当前位置: X-MOL 学术Int. J. Found. Comput. Sci. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Generalizations of Checking Stack Automata: Characterizations and Hierarchies
International Journal of Foundations of Computer Science ( IF 0.8 ) Pub Date : 2021-04-23 , DOI: 10.1142/s0129054121410045
Oscar H. Ibarra 1 , Ian McQuillan 2
Affiliation  

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.

中文翻译:

检查堆栈自动机的概括:表征和层次结构

我们通过允许多个输入头和多个堆栈来检查检查堆栈自动机的不同概括,并根据双向多头有限自动机和空间有界图灵机来描述它们的计算能力。对于各种模型,我们根据其计算能力获得层次结构。我们的表征和层次结构扩展或收紧了一些先前已知的结果。我们还讨论了一些可判定性问题和模型的空间/时间复杂度。
更新日期:2021-04-23
down
wechat
bug