On orbits and the finiteness of bounded automaton groups

DOI10.1142/S0218196721400087MaRDI QIDQ4957772zbMATH OpenFDO

Authors Ievgen Bondarenko, Jan Philipp Wächter

Publication date 9 September 2021

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

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

zbMATH Keywords

automaton groupbounded automatonfiniteness problemorbit

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• On the orbits of automaton semigroups and groups
• Infinite automaton semigroups and groups have infinite orbits
• On finite and Abelian groups generated by finite automata.
• Orbits of abelian automaton groups

Cites work

• An automaton group with undecidable order and Engel problems
• Automata, dynamical systems, and groups
• Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.
• Ends of Schreier graphs and cut-points of limit spaces of self-similar groups
• Groups generated by 3-state automata over a 2-letter alphabet. I.
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 2195483 (Why is no real title available?)
• scientific article; zbMATH DE number 7650891 (Why is no real title available?)
• On the conjugacy problem for finite-state automorphisms of regular rooted trees. With an appendix by Raphaël M. Jungers
• The conjugacy problem in automaton groups is not solvable.
• The finiteness problem for automaton semigroups is undecidable.
• The word and order problems for self-similar and automata groups

Cited in

(9)

• Some orbits of free words that are determined by measures on finite groups
• Orbit expandability of automaton semigroups and groups
• scientific article; zbMATH DE number 4017163 (Why is no real title available?)
• On elementary amenable bounded automata groups
• On the orbits of automaton semigroups and groups
• The word problem for finitary automaton groups
• On Orbits and the Finiteness of Bounded Automaton Groups
• Finiteness problem for automaton groups over a binary alphabet is almost decidable
• The finiteness problem for automaton semigroups of extended bounded activity

This page was built for publication: On orbits and the finiteness of bounded automaton groups

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