The word and order problems for self-similar and automata groups
Group Theory
2017-11-28 v4 Logic in Computer Science
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.
Keywords
Cite
@article{arxiv.1710.10109,
title = {The word and order problems for self-similar and automata groups},
author = {Laurent Bartholdi and Ivan Mitrofanov},
journal= {arXiv preprint arXiv:1710.10109},
year = {2017}
}
Comments
Fixed broken references