Abstract
We define the notion of height-deterministic pushdown automata, a model where for any given input string the stack heights during any (nondeterministic) computation on the input are a priori fixed. Different subclasses of height-deterministic pushdown automata, strictly containing the class of regular languages and still closed under boolean language operations, are considered. Several such language classes have been described in the literature. Here, we suggest a natural and intuitive model that subsumes all the formalisms proposed so far by employing height-deterministic pushdown automata. Decidability and complexity questions are also considered. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Nowotka, D., & Srba, J. (2007). Height-deterministic pushdown automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4708 LNCS, pp. 125–134). Springer Verlag. https://doi.org/10.1007/978-3-540-74456-6_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
