On orbits and the finiteness of bounded automaton groups

DOI10.1142/S0218196721400087MaRDI QIDQ4957772

Ievgen V. 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

orbitautomaton groupfiniteness problembounded automaton

Mathematics Subject Classification ID

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

Related Items (1)

The word problem for finitary automaton groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the conjugacy problem for finite-state automorphisms of regular rooted trees. With an appendix by Raphaël M. Jungers
• The word and order problems for self-similar and automata groups
• Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.
• An automaton group with undecidable order and Engel problems
• Ends of Schreier graphs and cut-points of limit spaces of self-similar groups
• The conjugacy problem in automaton groups is not solvable.
• Groups generated by 3-state automata over a 2-letter alphabet. I.
• THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE

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