On the conjugacy problem for finite-state automorphisms of regular rooted trees. With an appendix by Raphaël M. Jungers

DOI10.4171/GGD/184zbMath1286.20034arXiv1011.2227OpenAlexW2006669816MaRDI QIDQ355379

Mohammad Hasan, M. Dambrine

Publication date: 24 July 2013

Published in: Groups, Geometry, and Dynamics (Search for Journal in Brave)

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

zbMATH Keywords

finite automataconjugacy problemautomorphisms of rooted treesfinite-state automorphismsbounded automata

Mathematics Subject Classification ID

Trees (05C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Algebraic theory of languages and automata (68Q70) Automorphisms of infinite groups (20E36) Dynamical aspects of cellular automata (37B15) Automorphism groups of groups (20F28) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Groups acting on trees (20E08)

Related Items (19)

Automaton semigroups: the two-state case. ⋮ Freeness of automaton groups vs boundary dynamics ⋮ Numerical upper bounds on growth of automaton groups ⋮ Key agreement based on automaton groups ⋮ Orbit automata as a new tool to attack the order problem in automaton groups ⋮ Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness ⋮ The conjugacy problem in automaton groups is not solvable. ⋮ An automaton group with undecidable order and Engel problems ⋮ Some undecidability results for asynchronous transducers and the Brin-Thompson group $2V$ ⋮ The word problem for finitary automaton groups ⋮ Automaton (Semi)groups: Wang Tilings and Schreier Tries ⋮ Lifts, derandomization, and diameters of Schreier graphs of Mealy automata ⋮ Unnamed Item ⋮ Generic properties in some classes of automaton groups ⋮ On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata ⋮ On orbits and the finiteness of bounded automaton groups ⋮ Unnamed Item ⋮ The word and order problems for self-similar and automata groups ⋮ A New Hierarchy for Automaton Semigroups

Cites Work

• When is a pair of matrices mortal?
• Efficient algorithms for deciding the type of growth of products of integer matrices

This page was built for publication: On the conjugacy problem for finite-state automorphisms of regular rooted trees. With an appendix by Raphaël M. Jungers