AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK
From MaRDI portal
Publication:2996850
DOI10.1142/S0218196711006194zbMath1239.20033arXivmath/0610033MaRDI QIDQ2996850
Benjamin Steinberg, Yaroslav Vorobets, Mariya Vorobets
Publication date: 3 May 2011
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0610033
free groups; automaton groups; finite state automata; self-similar groups; free products of cyclic groups; bireversible automata
68Q70: Algebraic theory of languages and automata
20E05: Free nonabelian groups
20E06: Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations
20E08: Groups acting on trees
Related Items
Automaton semigroups: the two-state case., On the automaton complexity of wreath powers of non-Abelian finite simple groups., Automaton semigroups: new constructions results and examples of non-automaton semigroups, The concept of duality for automata over a changing alphabet and generation of a free group by such automata, Automaton semigroup constructions., Orbit automata as a new tool to attack the order problem in automaton groups, A geometric approach to (semi)-groups defined by automata via dual transducers., On groups generated by bi-reversible automata: the two-state case over a changing alphabet, Freeness of automaton groups vs boundary dynamics, The Lamplighter Group ℤ3≀ℤ Generated by a Bireversible Automaton
Cites Work
- Cyclic renormalization and automorphism groups of rooted trees
- Automata and square complexes.
- The spectra of lamplighter groups and Cayley machines.
- On a free group of transformations defined by an automaton.
- The Ihara zeta function of infinite graphs, the KNS spectral measure and integrable maps
- ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
- MONOIDS ACTING ON TREES: ELLIPTIC AND WREATH PRODUCTS AND THE HOLONOMY THEOREM FOR ARBITRARY MONOIDS WITH APPLICATIONS TO INFINITE GROUPS
- The Generation of GL(n, Z) by Finite State Automata
- The lamplighter group as a group generated by a 2-state automaton, and its spectrum