Characterizing the polynomial Hierarchy by alternating auxiliary pushdown automata
- First Online:
- Cite this paper as:
- Jenner B., Kirsig B. (1988) Characterizing the polynomial Hierarchy by alternating auxiliary pushdown automata. In: Cori R., Wirsing M. (eds) STACS 88. STACS 1988. Lecture Notes in Computer Science, vol 294. Springer, Berlin, Heidelberg
An alternating auxiliary pushdown hierarchy is defined by extending the machine model of the Logarithmic Alternation Hierarchy by a pushdown store while keeping a polynomial time bound. Although recently it was proven by Borodin et al. that the class of languages accepted by nondeterministic logarithmic space bounded auxiliary pushdown automata with a polynomial time bound is closed under complement [Bo et al], it is shown that, surprisingly, the further levels of this alternating auxiliary pushdown hierarchy coincide level by level with the Polynomial Hierarchy. Furthermore, it is shown that PSPACE can be characterized by simultaneously logarithmic space and polynomial time bounded auxiliary pushdown automata with unbounded alternation.
Unable to display preview. Download preview PDF.