The word and order problems for self-similar and automata groups

10/27/2017
by   Laurent Bartholdi, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset