Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1142/S0129054121410045 | INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE |
Keywords | Field | DocType |
Checking stack automata, multi-head finite automata, characterizations, space-bounded Turing machines, hierarchies | Discrete mathematics,Stack (abstract data type),Generalization,Computer science,Automaton,Finite-state machine,Theoretical computer science,Turing machine,Hierarchy | Conference |
Volume | Issue | ISSN |
32 | 05 | 0129-0541 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oscar H. Ibarra | 1 | 3235 | 741.44 |
| Ian McQuillan | 2 | 97 | 24.72 |