下推自动机与上下文无关文法在互模拟语义中的对应关系
Pushdown Automata and Context-Free Grammars in Bisimulation Semantics
AI总结：
本文在反应式图灵机及互模拟语义下，通过引入带中间接受的序列算子与状态感知概念，恢复了下推自动机与上下文无关文法之间的经典对应关系。
摘要：
图灵机模拟了一种老式计算机，它不与用户或其他计算机交互，仅进行批处理。因此，我们提出了反应式图灵机以克服这些缺陷。在反应式图灵机中，转移带有标签以提供交互性的概念。在生成的过程图中，我们使用互模拟等价而非语言等价。随后，我们考虑了自动机理论和形式语言理论中的其他经典定理与概念。本文中，我们研究了下推自动机与上下文无关文法之间对应关系的经典定理。通过将顺序复合的过程算子改为带有中间接受的序列算子，我们在该设定下获得了更好的对应关系。我们发现，恢复完全对应关系所缺失的要素是引入状态感知的概念。
英文摘要：
The Turing machine models an old-fashioned computer, that does not interact with the user or with other computers, and only does batch processing. Therefore, we came up with a Reactive Turing Machine that does not have these shortcomings. In the Reactive Turing Machine, transitions have labels to give a notion of interactivity. In the resulting process graph, we use bisimilarity instead of language equivalence. Subsequently, we considered other classical theorems and notions from automata theory and formal languages theory. In this paper, we consider the classical theorem of the correspondence between pushdown automata and context-free grammars. By changing the process operator of sequential composition to a sequencing operator with intermediate acceptance, we get a better correspondence in our setting. We find that the missing ingredient to recover the full correspondence is the addition of a notion of state awareness.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
