关于上下文相关语言和字问题的注记
A note on Context Sensitive languages and Word Problems
摘要：
Anisimov和Seifert证明了群有正则字问题当且仅当它是有限的。Muller和Schupp（以及Dunwoody的可及性结果）表明，一个群体有上下文无关的字问题，当且仅当它是几乎免费的。在本说明中，我们展示了一类群体的字问题是尽可能接近的上下文敏感的语言。这个类包括自动组，并且在传递到子组生成的子组时关闭。因此，它是相当大的，包括许多群体没有被列入。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
