Height-Deterministic Pushdown Automata

  • Dirk Nowotka
  • Jiří Srba
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4708)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Dirk Nowotka
    • 1
  • Jiří Srba
    • 2
  1. 1.Institut für Formale Methoden der Informatik, Universität StuttgartGermany
  2. 2.BRICS,Department of Computer Science, Aalborg UniversityDenmark

Personalised recommendations