'Amalgamated products of free groups: from algorithms to linguistic.'

30 April 2013
Elizaveta Frenkel

In my talk I shall give a small survey on some algorithmic properties of amalgamated products of finite rank 
free groups. In particular, I'm going to concentrate on Membership Problem for this groups. Apart from being algorithmically interesting, amalgams of free groups admit a lot of interpretations. I shall show how to 
characterize this construction from the point of view of geometry and linguistic.