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

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

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Groups, geometry and dynamics geometry and dynamics, 2020-01, Vol.14 (2), p.705-728
Hauptverfasser: Bartholdi, Laurent, Mitrofanov, Ivan
Format: Artikel
Sprache:eng
Schlagworte:
Computer science
Group Theory
Group theory and generalizations
Logic
Mathematical logic and foundations
Mathematics
Physical Sciences
Science & Technology
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1661-7207
1661-7215
DOI:10.4171/GGD/560