On orbits and the finiteness of bounded automaton groups
From MaRDI portal
Publication:4957772
Recommendations
Cites work
- 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?)
- 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.
- 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
(7)- On Orbits and the Finiteness of Bounded Automaton Groups
- scientific article; zbMATH DE number 4017163 (Why is no real title available?)
- On the orbits of automaton semigroups and groups
- The word problem for finitary automaton groups
- On elementary amenable bounded automata groups
- Some orbits of free words that are determined by measures on finite groups
- Orbit expandability of automaton semigroups and groups
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)