Abstract
There already exist classifications of those groups which have regular, context-free or recursively enumerable word problem. The only remaining step in the Chomsky hierarchy is to consider those groups with a context-sensitive word problem. In this paper we consider this problem and prove some results about these groups. We also establish some results about other context-sensitive decision problems in groups. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Lakin, S. R., & Thomas, R. M. (2004). Context-sensitive decision problems in groups. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3340, 296–307. https://doi.org/10.1007/978-3-540-30550-7_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
