On a series of finite automata defining free transformation groups.

DOI10.4171/GGD/87zbMath1227.20027arXivmath/0604328MaRDI QIDQ965093

Mariya Vorobets, Yaroslav Vorobets

Publication date: 21 April 2010

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) 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 ⋮ Some topics in the dynamics of group actions on rooted trees. ⋮ 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 ⋮ Automata generating free products of groups of order 2. ⋮ Lifts, derandomization, and diameters of Schreier graphs of Mealy automata ⋮ Herzog–Schönheim conjecture, vanishing sums of roots of Unity and convex polygons ⋮ A geometric approach to (semi)-groups defined by automata via dual transducers. ⋮ Catalan fragile words ⋮ 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

Cites Work

• Automata and square complexes.
• The Generation of GL(n, Z) by Finite State Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a series of finite automata defining free transformation groups.