Skip to main content
Conference Proceedings

Alternating and empty alternating auxiliary stack automata?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1893 415-425
DOI: 10.1007/3-540-44612-5_37
1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider variants of alternating auxiliary stack automata and characterize their computational power when the number of alternations is bounded by a constant or unlimited. In this way we get new characterizations of NP, the polynomial hierarchy, P Space, and bounded query classes like NL(NP[1]) and θ2P = PNP[O(log n)], in a uniform framework.

Cite

CITATION STYLE

APA

Holzer, M., & McKenzie, P. (2000). Alternating and empty alternating auxiliary stack automata? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1893, pp. 415–425). Springer Verlag. https://doi.org/10.1007/3-540-44612-5_37

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free