Name
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.4171/GGD/560 | GROUPS GEOMETRY AND DYNAMICS |
Keywords | Field | DocType |
Self-similar groups,automata groups,word problem,order problem,contracting groups,Mealy machines,Minsky machines | Automata theory,Algebra,Nested word,Word problem (mathematics education),Automaton,Mathematics,Recursion,Undecidable problem | Journal |
Volume | Issue | ISSN |
14 | 2 | 1661-7207 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Laurent Bartholdi | 1 | 27 | 8.74 |
| Ivan Mitrofanov | 2 | 0 | 0.34 |