有和没有上下文相关字问题的小组
Groups that do and do not have context-sensitive word problem
摘要：
我们证明了一个组有字问题，这是一个不断增长的上下文敏感的语言，如果它的字问题可以使用非确定性的加农算法（确定性算法定义的古德曼和夏皮罗）解决。我们概括了他们的结果，找到许多例子的团体不承认非确定性的加农算法。这增加了Kambites和Otto将上下文敏感和不断增长的上下文敏感字问题分开的群体的例子，并提供了新的语言理论分离结果。
英文摘要：
We prove that a group has word problem that is a growing context-sensitive language precisely if its word problem can be solved using a non-deterministic Cannon's algorithm (the deterministic algorithms being defined by Goodman and Shapiro). We generalise their results to find many examples of groups not admitting non-deterministic Cannon's algorithms. This adds to the examples of Kambites and Otto of groups separating context-sensitive and growing context-sensitive word problems, and provides a new language-theoretic separation result.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
