.png){kind=icon}
Return
On groups with EDT0L word problem
.png){kind=icon}
PRE
AI
DOI：10.1142/S0218196726500165.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We prove that the word problem for the infinite cyclic group is not EDT0L, and obtain as a corollary that a finitely generated group with EDT0L word problem must be torsion. In addition, we show that the property of having an EDT0L word problem is invariant under change of generating set, and passing to finitely generated subgroups. This represents significant progress toward the conjecture that all groups with EDT0L word problem are finite (i.e. precisely the groups with regular word problem).
Keywords:
Word problem
EDT0L language
finite-index EDT0L grammar
Journal
I
IF:
0.5
Papers:
44
Citations:
0
Organization
View more organizations
Cited Papers
No cited papers available