A subscription is required to access this article.
We prove that the word problem is undecidable in functionally recursive groups, and that the order problem is undecidable in automata groups, even under the assumption that they are contracting.
Cite this article
Laurent Bartholdi, Ivan Mitrofanov, The word and order problems for self-similar and automata groups. Groups Geom. Dyn. 14 (2020), no. 2, pp. 705–728DOI 10.4171/GGD/560