论文信息 - Alternating and Empty Alternating Auxiliary Stack Automata

Alternating and Empty Alternating Auxiliary Stack Automata

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.

Pierre McKenzie | Markus Holzer

[1] Richard J. Lipton,et al. Alternation Bounded Auxiliary Pushdown Automata , 1984, Inf. Control..

[2] Klaus W. Wagner,et al. Bounded Query Classes , 1990, SIAM J. Comput..

[3] Janos Simon,et al. Space-Bounded Hierarchies and Probabilistic Computations , 1984, J. Comput. Syst. Sci..

[4] Richard J. Lipton,et al. Alternating Pushdown and Stack Automata , 1984, SIAM J. Comput..

[5] Neil Immerman. Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..

[6] Stephen A. Cook,et al. Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.

[7] Oscar H. Ibarra,et al. Characterizations of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multihead and Auxiliary Stack Automata , 1971, J. Comput. Syst. Sci..

[8] Birgit Jenner,et al. Characterizing the Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata , 1988, STACS.

[9] Klaus-Jörn Lange,et al. Empty Alternation , 1994, MFCS.

[10] Ivan Hal Sudborough,et al. On the Tape Complexity of Deterministic Context-Free Languages , 1978, JACM.