The non-indexedness conjecture for the word problem of
Let be the free abelian group of rank , and let its word problem be the language of words over a finite generating set that represent the identity element of . Non-indexedness conjecture. The word problem for is not indexed. The paper places this question in the Chomsky hierarchy: word problems of finitely generated nilpotent groups are context-sensitive, while it remains unknown whether the word problem of is accepted by a nested stack automaton without extra restrictions.
References
Primary source
Murray Elder, “G-automata, counter languages and the Chomsky hierarchy”, arXiv:math/0508166 (2005).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.