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, PSpace, and bounded query classes like NL(NP[1]) and Θ2P = PNP[O(log n)] in a uniform framework.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have