Formal languages
Input-driven languages are in log n depth
Information Processing Letters
An introduction to Kolmogorov complexity and its applications
An introduction to Kolmogorov complexity and its applications
Journal of the ACM (JACM)
On the Tape Complexity of Deterministic Context-Free Languages
Journal of the ACM (JACM)
Algebraic and Automata-Theoretic Properties of Formal Languages
Algebraic and Automata-Theoretic Properties of Formal Languages
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Pebbling Moutain Ranges and its Application of DCFL-Recognition
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Input-Driven Languages are Recognized in log n Space
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Adding nesting structure to words
Journal of the ACM (JACM)
Nondeterministic state complexity of nested word automata
Theoretical Computer Science
Operational state complexity of nested word automata
Theoretical Computer Science
State complexity of operations on input-driven pushdown automata
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Operator precedence and the visibly pushdown property
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Minimizing variants of visibly pushdown automata
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Input-Driven queue automata: finite turns, decidability, and closure properties
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Hi-index | 0.00 |
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.