Automata generating free products of groups of order 2.

DOI10.1016/J.JALGEBRA.2011.02.049zbMATH Open1239.20032arXiv0806.4801OpenAlexW1980999981MaRDI QIDQ657941FDOQ657941

Dmytro Savchuk, Yaroslav Vorobets

Publication date: 11 January 2012

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

Abstract: We construct a family of automata with n states, n>3, acting on a rooted binary tree that generate the free products of cyclic groups of order 2.

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

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 the Burnside problem for periodic groups
• On Burnside's problem on periodic groups
• Title not available (Why is that?)
• Amenable semigroups
• Automata and square complexes.
• On a free group of transformations defined by an automaton.
• Classification of groups generated by 3-state automata over a 2-letter alphabet
• Title not available (Why is that?)
• On a series of finite automata defining free transformation groups.
• On a question of Atiyah
• An example of a finitely presented amenable group not belonging to the classEG
• Amenability via random walks.
• The Generation of GL(n, Z) by Finite State Automata
• ON A TORSION-FREE WEAKLY BRANCH GROUP DEFINED BY A THREE STATE AUTOMATON
• Title not available (Why is that?)
• Free products of finite groups and groups of finitely automatic permutations
• Free products of finite groups acting on regular rooted trees.
• Title not available (Why is that?)
• CONJUGATION IN TREE AUTOMORPHISM GROUPS

Cited In (21)

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

Uses Software

• AutomGrp

This page was built for publication: Automata generating free products of groups of order 2.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657941)