Orbit automata as a new tool to attack the order problem in automaton groups
DOI10.1016/J.JALGEBRA.2015.07.003zbMATH Open1383.20018arXiv1411.0158OpenAlexW2963819884MaRDI QIDQ891470FDOQ891470
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
Recommendations
torsion-freenessMealy automatonautomaton semigroupautomaton grouporder problemlabeled orbit treetree automorphism
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)
Cites Work
- On the Burnside problem for periodic groups
- On Burnside's problem on periodic groups
- Title not available (Why is that?)
- Automata and square complexes.
- On a free group of transformations defined by an automaton.
- The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable
- Automata over a binary alphabet generating free groups of even rank.
- On the conjugacy problem for finite-state automorphisms of regular rooted trees. With an appendix by Raphaël M. Jungers
- Classification of groups generated by 3-state automata over a 2-letter alphabet
- The finiteness problem for automaton semigroups is undecidable.
- Title not available (Why is that?)
- Automata generating free products of groups of order 2.
- On a series of finite automata defining free transformation groups.
- The Generation of GL(n, Z) by Finite State Automata
- Title not available (Why is that?)
- CONJUGATION IN TREE AUTOMORPHISM GROUPS
- The conjugacy problem in automaton groups is not solvable.
- On some algorithmic properties of finite state automorphisms of rooted trees.
- Some undecidability results for asynchronous transducers and the Brin-Thompson group \(2V\)
- On torsion-free semigroups generated by invertible reversible Mealy automata
- A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group
- On Sushchansky \(p\)-groups.
Cited In (16)
- 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
- A new hierarchy for automaton semigroups
- Affine automorphisms of rooted trees
- 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
- A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group
- The word and order problems for self-similar and automata groups
- A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group
Uses Software
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)