线性有界无限图
Linearly bounded infinite graphs
摘要：
线性有界图灵机主要作为上下文相关语言的接受者进行研究。我们定义了一个自然类的无限自动机表示其可观察的计算行为，称为线性有界图。这些自动机自然接受与定义它们的线性有界机器相同的语言。我们提出了一些他们的结构特性，以及替代表征重写系统和上下文敏感的转导。最后，我们将这些图与有理图进行了比较，有理图是另一类接受上下文敏感语言的自动机，并证明了在有界度的情况下，有理图是线性有界图的严格子类。
英文摘要：
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural class of infinite automata representing their observable computational behavior, called linearly bounded graphs. These automata naturally accept the same languages as the linearly bounded machines defining them. We present some of their structural properties as well as alternative characterizations in terms of rewriting systems and context-sensitive transductions. Finally, we compare these graphs to rational graphs, which are another class of automata accepting the context-sensitive languages, and prove that in the bounded-degree case, rational graphs are a strict sub-class of linearly bounded graphs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
