On a series of finite automata defining free transformation groups.

DOI10.4171/GGD/87zbMATH Open1227.20027arXivmath/0604328MaRDI QIDQ965093FDOQ965093

Authors: Mariya Vorobets, Yaroslav Vorobets 

Publication date: 21 April 2010

Published in: Groups, Geometry, and Dynamics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/math/0604328

Recommendations

• On a free group of transformations defined by an automaton.
• On free semigroups of automaton transformations
• Groups generated by 3-state automata over a 2-letter alphabet. II.
• Finite automaton actions of free groups
• Finite automata of polynomial growth do not generate a free group.

zbMATH Keywords

finite automataautomaton groupsfree products of cyclic groupsfree non-Abelian groupsfree transformation groups

Mathematics Subject Classification ID

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) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Automata and square complexes.
• Automata, dynamical systems, and groups
• The Generation of GL(n, Z) by Finite State Automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Commensurators of groups and reversible automata
• Title not available (Why is that?)

Cited In (29)

• 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
• 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.
• Boundary dynamics for bireversible and for contracting automaton groups
• Automata generating free products of groups of order 2.
• Automaton groups and complete square complexes
• 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
• Title not available (Why is that?)
• Almost-automorphisms of trees, cloning systems and finiteness properties
• Title not available (Why is that?)
• The lamplighter group \(\mathbb Z_3 \wr \mathbb Z\) generated by a bireversible automaton
• Bireversible automata generating lamplighter groups
• Herzog–Schönheim conjecture, vanishing sums of roots of Unity and convex polygons
• Title not available (Why is that?)
• On a free group of transformations defined by an automaton.
• 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)