On orbits and the finiteness of bounded automaton groups

DOI10.1142/S0218196721400087MaRDI QIDQ4957772FDOQ4957772

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

orbitautomaton groupfiniteness problembounded automaton

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)

Cites Work

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

Cited In (6)

• Orbit expandability of automaton semigroups and groups
• On Orbits and the Finiteness of Bounded Automaton Groups
• Some orbits of free words that are determined by measures on finite groups
• The word problem for finitary automaton groups
• On elementary amenable bounded automata groups
• Title not available (Why is that?)

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)