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.

中文翻译：

---

自相似和自动机群的单词和顺序问题

我们证明在功能递归组中单词问题是无法确定的，并且在自动机组中甚至在假设它们正在收缩的情况下，订单问题也是无法确定的。