On a series of finite automata defining free transformation groups.
From MaRDI portal
(Redirected from Publication:965093)
Abstract: We introduce two series of finite automata starting from the so-called Aleshin and Bellaterra automata. We prove that each automaton in the first series defines a free non-Abelian group while each automaton in the second series defines the free product of groups of order 2. Furthermore, these properties are shared by disjoint unions of any number of distinct automata from either series.
Recommendations
Cites work
- scientific article; zbMATH DE number 3810927 (Why is no real title available?)
- scientific article; zbMATH DE number 4047960 (Why is no real title available?)
- scientific article; zbMATH DE number 1984019 (Why is no real title available?)
- scientific article; zbMATH DE number 2156384 (Why is no real title available?)
- scientific article; zbMATH DE number 3285241 (Why is no real title available?)
- Automata and square complexes.
- Automata, dynamical systems, and groups
- Commensurators of groups and reversible automata
- The Generation of GL(n, Z) by Finite State Automata
Cited in
(29)- On the automaton complexity of wreath powers of non-Abelian finite simple groups.
- Freeness of automaton groups vs boundary dynamics
- The concept of duality for automata over a changing alphabet and generation of a free group by such automata
- Generation of amalgamated free products of cyclic groups by finite automata over minimal alphabet
- Some topics in the dynamics of group actions on rooted trees.
- Automata with restricted memory and shift endomorphisms
- On the transition monoid of the Stallings automaton of a subgroup of a free group
- Automaton semigroups: the two-state case.
- Catalan fragile words
- A geometric approach to (semi)-groups defined by automata via dual transducers.
- Automata generating free products of groups of order 2.
- Automaton groups and complete square complexes
- Boundary dynamics for bireversible and for contracting automaton groups
- Free groups defined by finite $p$-automata
- The groups of \(ZC\)-automaton transformations.
- Orbit automata as a new tool to attack the order problem in automaton groups
- Algebraic properties of transformations defined by slow-moving automata of finite type
- 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
- scientific article; zbMATH DE number 3993847 (Why is no real title available?)
- Almost-automorphisms of trees, cloning systems and finiteness properties
- The lamplighter group \(\mathbb Z_3 \wr \mathbb Z\) generated by a bireversible automaton
- scientific article; zbMATH DE number 927925 (Why is no real title available?)
- Bireversible automata generating lamplighter groups
- Herzog–Schönheim conjecture, vanishing sums of roots of Unity and convex polygons
- On a free group of transformations defined by an automaton.
- scientific article; zbMATH DE number 599365 (Why is no real title available?)
- Lifts, derandomization, and diameters of Schreier graphs of Mealy automata
This page was built for publication: On a series of finite automata defining free transformation groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q965093)
