Characterizing the polynomial Hierarchy by alternating auxiliary pushdown automata

  • Birgit Jenner
  • Bernd Kirsig
Contributed Papers Complexity

DOI: 10.1007/BFb0035838

Part of the Lecture Notes in Computer Science book series (LNCS, volume 294)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1988

Authors and Affiliations

  • Birgit Jenner
    • 1
  • Bernd Kirsig
    • 1
  1. 1.Universität Hamburg, Fachbereich InformatikHamburg 13

Personalised recommendations