Finite automata of polynomial growth do not generate a free group.

DOI10.1007/s10711-004-2368-0zbMath1075.20011MaRDI QIDQ1768261

Xianqiang Yang

Publication date: 15 March 2005

Published in: Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10711-004-2368-0

zbMATH Keywords

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

Mathematics Subject Classification ID

68Q45: Formal languages and automata

20F05: Generators, relations, and presentations of groups

20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)

20E08: Groups acting on trees