论文标题
检查堆栈自动机的概括：特征和层次结构
Generalizations of Checking Stack Automata: Characterizations and Hierarchies
论文作者
论文摘要
我们通过允许多个输入头和多个堆栈来检查检查堆栈自动机的不同概括，并根据双向多头有限自动机和空间结合的图灵机表征其计算能力。对于各种模型，我们从其计算能力方面获得层次结构。我们的特征和层次结构扩展或收紧了一些以前已知的结果。我们还讨论了一些可决定性问题以及模型的空间/时间复杂性。
We examine different generalizations of checking stack automata by allowing multiple input heads and multiple stacks, and characterize their computing power in terms of two-way multi-head finite automata and space-bounded Turing machines. For various models, we obtain hierarchies in terms of their computing power. Our characterizations and hierarchies expand or tighten some previously known results. We also discuss some decidability questions and the space/time complexity of the models.
