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.
- Publication:
-
arXiv e-prints
- Pub Date:
- October 2017
- DOI:
- arXiv:
- arXiv:1710.10109
- Bibcode:
- 2017arXiv171010109B
- Keywords:
-
- Mathematics - Group Theory;
- Computer Science - Logic in Computer Science
- E-Print:
- Fixed broken references