Orbit automata as a new tool to attack the order problem in automaton groups

DOI10.1016/J.JALGEBRA.2015.07.003MaRDI QIDQ891470zbMATH OpenOpenAlexFDO

Authors Ines Klimann, Matthieu Picantin, Dmytro Savchuk

Publication date 17 November 2015

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

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

zbMATH Keywords

torsion-freenessMealy automatonautomaton semigroupautomaton grouporder problemlabeled orbit treetree automorphism

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Groups acting on trees (20E08) Algebraic theory of languages and automata (68Q70) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Semigroups in automata theory, linguistics, etc. (20M35)

Abstract: We introduce a new tool, called the orbit automaton, that describes the action of an automaton group $G$ on the subtrees corresponding to the orbits of $G$ on levels of the tree. The connection between $G$ and the groups generated by the orbit automata is used to find elements of infinite order in certain automaton groups for which other methods failed to work.

Recommendations

• Infinite automaton semigroups and groups have infinite orbits
• An automaton group with undecidable order and Engel problems
• Orbits of abelian automaton groups
• The word and order problems for self-similar and automata groups

Cites work

• scientific article; zbMATH DE number 3810927 (Why is no real title available?)
• scientific article; zbMATH DE number 2195483 (Why is no real title available?)
• scientific article; zbMATH DE number 3389248 (Why is no real title available?)
• A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group
• Automata and square complexes.
• Automata generating free products of groups of order 2.
• Automata over a binary alphabet generating free groups of even rank.
• CONJUGATION IN TREE AUTOMORPHISM GROUPS
• Classification of groups generated by 3-state automata over a 2-letter alphabet
• On Burnside's problem on periodic groups
• On Sushchansky \(p\)-groups.
• On a free group of transformations defined by an automaton.
• On a series of finite automata defining free transformation groups.
• On some algorithmic properties of finite state automorphisms of rooted trees.
• On the Burnside problem for periodic groups
• On the conjugacy problem for finite-state automorphisms of regular rooted trees. With an appendix by Raphaël M. Jungers
• On torsion-free semigroups generated by invertible reversible Mealy automata
• Some undecidability results for asynchronous transducers and the Brin-Thompson group \(2V\)
• The Generation of GL(n, Z) by Finite State Automata
• The conjugacy problem in automaton groups is not solvable.
• The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable
• The finiteness problem for automaton semigroups is undecidable.

Cited in

(16)

• A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group
• Ergodic decomposition of group actions on rooted trees
• Orbit expandability of automaton semigroups and groups
• Infinite automaton semigroups and groups have infinite orbits
• Automatic semigroups vs automaton semigroups
• A new hierarchy for automaton semigroups
• The order of a group machine
• An automaton group with undecidable order and Engel problems
• Affine automorphisms of rooted trees
• A new hierarchy for automaton semigroups
• Boundary dynamics for bireversible and for contracting automaton groups
• Orbits of abelian automaton groups
• Automaton (semi)groups: Wang tilings and Schreier tries
• The lamplighter group of rank two generated by a bireversible automaton
• The word and order problems for self-similar and automata groups
• A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group

Describes a project that uses

Uses Software

• FR
• AutomGrp
• GAP

This page was built for publication: Orbit automata as a new tool to attack the order problem in automaton groups

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