The word and order problems for self-similar and automata groups
classification
🧮 math.GR
cs.LO
keywords
groupsautomataorderproblemundecidablewordassumptioncontracting
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.