The word and order problems for self-similar and automata groups
Abstract
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.
Origin : Files produced by the author(s)