TREE-WREATHING APPLIED TO GENERATION OF GROUPS BY FINITE AUTOMATA

DOI10.1142/S0218196705002554zbMath1108.20025OpenAlexW2107953842MaRDI QIDQ3379491

No author found.

Publication date: 6 April 2006

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196705002554

zbMATH Keywords

groups generated by finite synchronous automatagroups of automorphisms of binary treesresidually finite 2-groupstree-wreath products

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Generators, relations, and presentations of groups (20F05) Extensions, wreath products, and other compositions of groups (20E22) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Groups acting on trees (20E08)

Related Items (3)

On state-closed representations of restricted wreath product of groups \(G_{p,d}=C_{p}wrC^{d}\) ⋮ Finite automata of polynomial growth do not generate a free group. ⋮ Some commutation patterns between involutions of a finite group. I

Cites Work

• Unnamed Item
• Free subgroups of branch groups.
• Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.
• Finite automata of polynomial growth do not generate a free group.
• Wreath operations in the group of automorphisms of the binary tree

This page was built for publication: TREE-WREATHING APPLIED TO GENERATION OF GROUPS BY FINITE AUTOMATA