Automata generating free products of groups of order 2.

DOI10.1016/j.jalgebra.2011.02.049zbMath1239.20032arXiv0806.4801OpenAlexW1980999981MaRDI QIDQ657941

Dmytro Savchuk, Yaroslav Vorobets

Publication date: 11 January 2012

Published in: Journal of Algebra (Search for Journal in Brave)

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

zbMATH Keywords

free productsgroups acting on treesgroups generated by automatabireversible automatadual automata

Mathematics Subject Classification ID

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

Related Items

Automaton semigroups: the two-state case. ⋮ A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group ⋮ Automaton groups and complete square complexes ⋮ Implementing Computations in Automaton (Semi)groups ⋮ Finite-state self-similar actions of nilpotent groups. ⋮ On the lattice of subgroups of the lamplighter group ⋮ Orbit automata as a new tool to attack the order problem in automaton groups ⋮ A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group ⋮ Automaton (Semi)groups: Wang Tilings and Schreier Tries ⋮ Unnamed Item ⋮ 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 ⋮ Lifts, derandomization, and diameters of Schreier graphs of Mealy automata ⋮ A geometric approach to (semi)-groups defined by automata via dual transducers. ⋮ The Lamplighter Group ℤ₃≀ℤ Generated by a Bireversible Automaton ⋮ On the existence of free subsemigroups in reversible automata semigroups ⋮ Almost-automorphisms of trees, cloning systems and finiteness properties ⋮ Lamplighter groups, bireversible automata, and rational series over finite rings

Uses Software

• AutomGrp

Cites Work

• Amenable semigroups
• Amenability via random walks.
• On a series of finite automata defining free transformation groups.
• On the Burnside problem for periodic groups
• On Burnside's problem on periodic groups
• Automata and square complexes.
• On a free group of transformations defined by an automaton.
• On a question of Atiyah
• Classification of groups generated by 3-state automata over a 2-letter alphabet
• An example of a finitely presented amenable group not belonging to the classEG
• The Generation of GL(n, Z) by Finite State Automata
• CONJUGATION IN TREE AUTOMORPHISM GROUPS
• ON A TORSION-FREE WEAKLY BRANCH GROUP DEFINED BY A THREE STATE AUTOMATON
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item