A note on Context Sensitive languages and Word Problems
Michael Shapiro
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.
Create a lesson
Related papers
Invariant random subgroups of the finitary special linear group over a finite field
Noam Atar, Arie Levit
Vanishing-set inclusion and character degrees in finite p-groups
Zhi-Lin Zhang
Singular Loci of SL2(C)-Representation Varieties of Non-Hopfian Baumslag--Solitar Groups
S. Liriano
Finite groups with all involutions fused
Zheng Guo, Yan Zhou Zhu
A complete description of the algebraic structure of pseudocompact abelian groups
Dikran Dikranjan, Alejandro Dorantes-Aldama, Dmitri Shakhmatov
Constructing free subgroups of matrix groups
Emmanuel Breuillard, Bettina Eick, Tommy Hofmann et al.