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

  • Laurent Bartholdi

    École Normale Supérieure de Lyons, France and Universität Göttingen, Germany
  • Ivan Mitrofanov

    École Normale Supérieure, Paris, France
The word and order problems for self-similar and automata groups cover
Download PDF

A subscription is required to access this article.

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.

Cite this article

Laurent Bartholdi, Ivan Mitrofanov, The word and order problems for self-similar and automata groups. Groups Geom. Dyn. 14 (2020), no. 2, pp. 705–728

DOI 10.4171/GGD/560