Name
Abstract | ||
|---|---|---|
We introduce and investigate input-driven stack automata, which are a generalization of input-driven pushdown automata that recently became popular under the name visibly pushdown automata. Basically, the idea is that the input letters uniquely determine the operations on the pushdown store. This can nicely be generalized to stack automata by further types of input letters which are responsible for moving the stack pointer up or down. While visibly pushdown languages share many desirable properties with regular languages, input-driven stack automata languages do not necessarily so. We prove that deterministic and nondeterministic input-driven stack automata have different computational power, which shows in passing that one cannot construct a deterministic input-driven stack automaton from a nondeterministic one. We study the computational capacity of these devices. Moreover, it is shown that the membership problem for nondeterministic input-driven stack automata languages is NP-complete. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-33475-7_3 | Theoretical Computer Science |
Keywords | Field | DocType |
computational capacity,input-driven pushdown automaton,nondeterministic input-driven,pushdown automaton,automata language,pushdown store,different computational power,desirable property,input letter,pushdown language | Quantum finite automata,Embedded pushdown automaton,Discrete mathematics,Automata theory,Nondeterministic finite automaton,Nested word,Computer science,Nested stack automaton,Deterministic pushdown automaton,Theoretical computer science,Pushdown automaton | Conference |
Citations | PageRank | References |
1 | 0.36 | 14 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Suna Bensch | 1 | 42 | 14.67 |
| Markus Holzer | 2 | 27 | 6.73 |
| Martin Kutrib | 3 | 778 | 89.77 |
| Andreas Malcher | 4 | 204 | 39.40 |