Finite automata of polynomial growth do not generate a free group

Geometriae Dedicata

Volumn 108, Issue 1, 2004, Pages 193-204

  Sidki, Said ^a  

^a UNIVERSITY OF BRASILIA   (Brazil)

Author keywords

automorphisms of trees; finite automata; free groups; polynomial growth; rooted tree

Indexed keywords

EID: 10044284507     PISSN: 00465755     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10711-004-2368-0     Document Type: Article

References (10)

1. Brunner, A. and Sidki, S.: The generation of GL(n, ℤ) by finite-state automata, Internat. J. Algebra Comput. 8 (1998), 127-139.
2. Nekrachevych, V. V. and Sidki, S.: Automorphisms of the binary tree: state-closed subgroups and dynamics of 1/2-endomorphisms, In: T. M. Müller (ed.), Groups-Topological, Combinatorial and Arithmetic Aspects, Cambridge University Press, 2003.
3. Sidki, S.: Automorphisms of one-rooted trees: growth, circuit structure and acyclicity, J. Math. Sci. 100 (2000), 1925-1943.
4. Ufnarovski, V. A.: On the use of graphs for calculating the basis, growth and Hilbert series of associative algebras, Math. USSR-Sb. 68 (1991), 417-428.
5. Sidki, S. and Silva, E. F.: A family of just-nonsolvable torsion-free groups defined on n-ary trees, In: Atas da XVI Escola de Álgebra, Brasília, Matemática Contemporânea 21 (2001), 255-274.
6. Brunner, A., Sidki, S. and Vieira, A. C.: A just-nonsolvable torsion-free group defined on the binary tree, J. Algebra 211 (1999), 99-114.
7. Grigorchuk, R. I.: On the Burnside problem on periodic groups, Funct. Anal. Appl. 14 (1980), 41-43.
8. Gupta, N. and Sidki, S.: On the Burnside problem on periodic groups. Math. Z. 182 (1983), 385-388.
9. Brunner, A. and Sidki, S.: Wreath operations in the group of automorphisms of the binary tree, J. Algebra 257 (2002), 51-64.
10. Sidki, S.: Tree-wreathing applied to generation of groups by finite automata, in press.