The method of forced enumeration for nondeterministic automata
Acta Informatica
Nondeterministic space is closed under complementation
SIAM Journal on Computing
Handbook of formal languages, vol. 1
Context-free languages and pushdown automata
Handbook of formal languages, vol. 1
Journal of the ACM (JACM)
An Infinite Hierarchy of Context-Free Languages
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Space-bounded reducibility among combinatorial problems
Journal of Computer and System Sciences
More concise representation of regular languages by automata and regular expressions
Information and Computation
The size-cost of Boolean operations on constant height deterministic pushdown automata
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
On contextual grammars with subregular selection languages
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Hi-index | 0.00 |
It is well known that the pushdown store languageP(M) of a pushdown automaton (PDA) M -- i.e., the language consisting of words occurring on the pushdown along accepting computations of M -- is a regular language. Here, we design succinct nondeterministic finite automata (NFA) accepting P(M). In detail, an upper bound on the size of an NFA for P(M) is obtained, which is quadratic in the number of states and linear in the number of pushdown symbols of M. Moreover, this upper bound is shown to be asymptotically optimal. Then, several restricted variants of PDA are considered, leading to improved constructions. In all cases, we prove the asymptotical optimality of the size of the resulting NFA. Finally, we apply our results to decidability questions related to PDA, and obtain solutions in deterministic polynomial time.