AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK

DOI10.1142/S0218196711006194zbMath1239.20033arXivmath/0610033MaRDI QIDQ2996850

Benjamin Steinberg, Mariya Vorobets, Yaroslav 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

zbMATH Keywords

free groupsautomaton groupsfinite state automataself-similar groupsfree products of cyclic groupsbireversible automata

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Free nonabelian groups (20E05) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Groups acting on trees (20E08)

Related Items (19)

Automaton semigroups: the two-state case. ⋮ Freeness of automaton groups vs boundary dynamics ⋮ Automaton groups and complete square complexes ⋮ On groups generated by bi-reversible automata: the two-state case over a changing alphabet ⋮ 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. ⋮ Bireversible automata generating lamplighter groups ⋮ Generation of amalgamated free products of cyclic groups by finite automata over minimal alphabet ⋮ The concept of duality for automata over a changing alphabet and generation of a free group by such automata ⋮ The lamplighter group of rank two generated by a bireversible automaton ⋮ Automaton semigroups: new constructions results and examples of non-automaton semigroups ⋮ A geometric approach to (semi)-groups defined by automata via dual transducers. ⋮ Catalan fragile words ⋮ Fragile words and Cayley type transducers ⋮ Automaton semigroup constructions. ⋮ Boundary dynamics for bireversible and for contracting automaton groups ⋮ The Lamplighter Group ℤ₃≀ℤ Generated by a Bireversible Automaton ⋮ Almost-automorphisms of trees, cloning systems and finiteness properties ⋮ Lamplighter groups, bireversible automata, and rational series over finite rings

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

This page was built for publication: AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK