Conjugacy problem in an automorphism group of an infinite tree
From MaRDI portal
Publication:1290797
DOI10.1007/BF02314633zbMath0949.20025OpenAlexW2027579516MaRDI QIDQ1290797
Publication date: 5 September 2000
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02314633
Periodic groups; locally finite groups (20F50) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items
Unnamed Item ⋮ Key agreement based on automaton groups ⋮ The conjugacy problem in automaton groups is not solvable. ⋮ Some topics in the dynamics of group actions on rooted trees. ⋮ Log-space conjugacy problem in the Grigorchuk group ⋮ The conjugacy problem in the Grigorchuk group is polynomial time decidable. ⋮ Linear time algorithm for the conjugacy problem in the first Grigorchuk group ⋮ Quadratic equations in the Grigorchuk group.
Cites Work
