Automata over a binary alphabet generating free groups of even rank.
DOI10.1142/S0218196711006194zbMATH Open1239.20033arXivmath/0610033MaRDI QIDQ2996850FDOQ2996850
Authors: 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
Recommendations
free groupsfinite state automataself-similar groupsautomaton groupsfree products of cyclic groupsbireversible automata
Free nonabelian groups (20E05) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Groups acting on trees (20E08) Algebraic theory of languages and automata (68Q70)
Cites Work
- ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
- Automata and square complexes.
- On a free group of transformations defined by an automaton.
- The lamplighter group as a group generated by a 2-state automaton, and its spectrum
- The Generation of GL(n, Z) by Finite State Automata
- The spectra of lamplighter groups and Cayley machines.
- The Ihara zeta function of infinite graphs, the KNS spectral measure and integrable maps
- Cyclic renormalization and automorphism groups of rooted trees
- MONOIDS ACTING ON TREES: ELLIPTIC AND WREATH PRODUCTS AND THE HOLONOMY THEOREM FOR ARBITRARY MONOIDS WITH APPLICATIONS TO INFINITE GROUPS
Cited In (27)
- Representations of a free group of rank two by time-varying Mealy automata
- Automaton semigroup constructions.
- On the automaton complexity of wreath powers of non-Abelian finite simple groups.
- Freeness of automaton groups vs boundary dynamics
- 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
- Fragile words and Cayley type transducers
- Automaton semigroups: the two-state case.
- Catalan fragile words
- A geometric approach to (semi)-groups defined by automata via dual transducers.
- Automaton ranks of some self-similar groups.
- Boundary dynamics for bireversible and for contracting automaton groups
- Automaton groups and complete square complexes
- Finite automaton actions of free groups
- Free groups defined by finite $p$-automata
- Orbit automata as a new tool to attack the order problem in automaton groups
- Finite automata of polynomial growth do not generate a free group.
- On groups generated by bi-reversible automata: the two-state case over a changing alphabet
- The lamplighter group of rank two generated by a bireversible automaton
- Almost-automorphisms of trees, cloning systems and finiteness properties
- The lamplighter group \(\mathbb Z_3 \wr \mathbb Z\) generated by a bireversible automaton
- Lamplighter groups, bireversible automata, and rational series over finite rings
- Bireversible automata generating lamplighter groups
- On a free group of transformations defined by an automaton.
- Finite automata over free groups
- On a finite state representation of GL(n,Z)
- Automaton semigroups: new constructions results and examples of non-automaton semigroups
This page was built for publication: Automata over a binary alphabet generating free groups of even rank.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2996850)
