A note on Context Sensitive languages and Word Problems
Group Theory
2008-02-03 v1
Abstract
Anisimov and Seifert show that a group has a regular word problem ifand only if it is finite. Muller and Schupp (together with Dunwoody's accessibility result) show that a group has context free word problem if and only if it is virtually free. In this note, we exhibit a class of groups where the word problem is as close as possible to being a context sensitive language. This class includes the automatic groups and is closed under passing to finitely generated subgroups. Consequently, it is quite large, including many groups which are not finitely presented.
Cite
@article{arxiv.math/9306204,
title = {A note on Context Sensitive languages and Word Problems},
author = {Michael Shapiro},
journal= {arXiv preprint arXiv:math/9306204},
year = {2008}
}
Comments
AMS-Tex, 3 pages, no figures