Classification of groups generated by 3-state automata over a 2-letter alphabet
From MaRDI portal
Publication:3607847
zbMath1164.20004arXiv0803.3555MaRDI QIDQ3607847
Zoran Šunić, Ye. V. Muntyan, Ievgen V. Bondarenko, Rostislav Kravchenko, Dmytro Savchuk, Rostislav I. Grigorchuk, Volodymyr V. Nekrashevych
Publication date: 28 February 2009
Full work available at URL: https://arxiv.org/abs/0803.3555
growth functionsautomata groupsbranch groupsself-similar groupsgroups generated by automatarelatorsiterated monodromy groups
Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Algebraic theory of languages and automata (68Q70) Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets (37F10) Groups acting on trees (20E08)
Related Items
Automaton semigroups: the two-state case. ⋮ Ergodic decomposition of group actions on rooted trees ⋮ Automaton groups and complete square complexes ⋮ On Mealy–Moore coding and images of Markov measures ⋮ Orbit automata as a new tool to attack the order problem in automaton groups ⋮ On the automaton complexity of wreath powers of non-Abelian finite simple groups. ⋮ Introduction to iterated monodromy groups ⋮ On a family of Schreier graphs of intermediate growth associated with a self-similar group ⋮ Some topics in the dynamics of group actions on rooted trees. ⋮ Automata generating free products of groups of order 2. ⋮ Lifts, derandomization, and diameters of Schreier graphs of Mealy automata ⋮ On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata ⋮ From Self-Similar Groups to Self-Similar Sets and Spectra ⋮ Pattern closure of groups of tree automorphisms
Uses Software
