Compressed words and automorphisms in fully residually free groups

International Journal of Algebra and Computation

Volumn 20, Issue 3, 2010, Pages 343-355

  MacDonald, Jeremy ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

Automorphism group; Compressed words; Fully residually free groups; Limit groups; Word problem

Indexed keywords

EID: 77953771005     PISSN: 02181967     EISSN: None     Source Type: Journal    
DOI: 10.1142/S021819671000542X     Document Type: Article

References (10)

1. I. Bumagin, O. Kharlampovich and A. Myasnikov, The isomorphism problem for finitely generated fully residually free groups, J. Pure Appl. Algebra 208(3) (2007) 961-977.
2. N. D. Gilbert, Presentations of the automorphism group of a free product, Proc. London Math. Soc. (3) 54(1) (1987) 115-140.
3. O. Kharlampovich and A. Myasnikov, Irreducible affine varieties over a free group. II. Systems in triangular quasi-quadratic form and description of residually free groups, J. Algebra 200(2) (1998) 517-570.
4. O. Kharlampovich and A. Myasnikov, Effective JSJ decompositions, Comtemporary Mathematics 378 (2005).
5. M. Lohrey, Word problems on compressed words, in Automata, Languages and Programming, Lecture Notes in Comput. Sci., Vol.3142 (Springer, Berlin, 2004), pp. 906-918.
6. M. Lohrey and S. Schleimer, Efficient computation in groups via compression, in Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007. Proceedings, Lecture Notes in Computer Science, Vol.4649 (Springer, Berlin/Heidelberg, 2007), pp. 249-258.
7. R. Lyndon, Groups with parametric exponents, Trans. Amer. Math. Soc. 96 (1960) 518-533.
8. A. Myasnikov, V. Remeslennikov and D. Serbin, Regular free length functions on Lyndon's free Z[t]-group FZ[t], in Groups, Languages, Algorithms, Contemp. Math., Vol.378 (Amer. Math. Soc., Providence, RI, 2005), pp. 37-77.
9. W. Plandowski, Testing equivalence of morphisms on context-free languages, in Algorithms - ESA '94 (Utrecht), Vol.855, Lecture Notes in Comput. Sci. (Springer, Berlin, 1994), pp. 460-470.
10. S. Schleimer, Polynomial-time word problems, Comment. Math. Helv. 83(4) (2008) 741-765.