Alternating and Empty Alternating Auxiliary Stack Automata

Authors:
Markus Holzer;Pierre McKenzie
Affiliations:
-;-
Venue:
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Year:
2000

Citing 9
Cited 0

The method of forced enumeration for nondeterministic automata

Acta Informatica
Nondeterministic space is closed under complementation

SIAM Journal on Computing
Bounded query classes

SIAM Journal on Computing
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

Journal of the ACM (JACM)
On the Tape Complexity of Deterministic Context-Free Languages

Journal of the ACM (JACM)
Alternation

Journal of the ACM (JACM)
Empty Alternation

MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
Characterizing the Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata

STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science
Characterizations of some tape and time complexity classes of turing machines in terms of multihead and auxiliary stack automata

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.01

Visualization

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.