The conjugacy problem in automaton groups is not solvable.

DOI10.1016/j.jalgebra.2012.04.014zbMath1261.20034arXiv1010.1993MaRDI QIDQ1936130

Zoran Šunić, Enric Ventura Capell

Publication date: 21 February 2013

Published in: Journal of Algebra (Search for Journal in Brave)

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

zbMATH Keywords

free subgroups; automaton groups; conjugacy problem; self-similar groups; orbit decidability; (free Abelian)-by-free groups

Mathematics Subject Classification ID

20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)

20E08: Groups acting on trees

Related Items

Automaton (Semi)groups: Wang Tilings and Schreier Tries, Unnamed Item, On orbits and the finiteness of bounded automaton groups, THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE, The word problem for finitary automaton groups, Some topics in the dynamics of group actions on rooted trees., On the structure theory of partial automaton semigroups, Orbit automata as a new tool to attack the order problem in automaton groups, An automaton group with undecidable order and Engel problems, Permutive one-way cellular automata and the finiteness problem for automaton groups, Corrigendum to: ``Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness, Key agreement based on automaton groups, Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness, On a class of poly-context-free groups generated by automata, An automaton group with \textsf{PSPACE}-complete word problem, Implementing Computations in Automaton (Semi)groups, Finitely Generated Semiautomatic Groups

Cites Work

• 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 conjugacy problem in the Grigorchuk group is polynomial time decidable.
• Free subgroups in groups acting on rooted trees
• On the Burnside problem for periodic groups
• On Burnside's problem on periodic groups
• Conjugacy problem in a class of \(2\)-groups
• Conjugacy problem in an automorphism group of an infinite tree
• Conjugacy separability of certain torsion groups
• Finite automata of polynomial growth do not generate a free group.
• Free subgroups in linear groups
• Orbit decidability and the conjugacy problem for some extensions of groups
• The Generation of GL(n, Z) by Finite State Automata