Alternating and empty alternating auxiliary stack automata

Theoretical Computer Science

Volumn 299, Issue 1-3, 2003, Pages 307-326

  Holzer, Markus ^a,b   McKenzie, Pierre ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; POLYNOMIALS; QUERY LANGUAGES; SET THEORY;

AUXILIARY STACK AUTOMATA;

AUTOMATA THEORY;

EID: 0037453395     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00326-2     Document Type: Article

References (24)

1. Balcázar J.L., Díaz J., Gabarró J. Structural Complexity I. EATCS Monographs on Theoretical Computer Science. Vol. 11:1988;Springer, Berlin.
2. Burks A.W., Warren D.W., Wright J.B. An analysis of a logical machine using parenthesis-free notation. Math. Tables Other Aids Comput. 8(46):1954;53-57.
3. Chandra A.K., Kozen D.C., Stockmeyer L.J. Alternation. J. ACM. 28(1):1981;114-133.
4. Cook S.A. Characterizations of pushdown machines in terms of time-bounded computers. J. ACM. 18(1):1971;4-18.
5. Ginsburg S., Greibach S.A., Harrison M.A. One-way stack automata. J. ACM. 14(2):1967;389-418.
6. Greibach S.A. Checking automata and one-way stack languages. J. Comput. System Sci. 3(2):1969;196-217.
7. Hopcroft J.E., Ullman J.D. Nonerasing stack automata. J. Comput. System Sci. 1(2):1967;166-186.
8. Hopcroft J.E., Ullman J.D. Introduction to Automata Theory, Languages and Computation. 1979;Addison-Wesley, Reading, MA.
9. Ibarra O.H. Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata. J. Comput. System Sci. 5(2):1971;88-117.
10. Immerman N. Nondeterministic space is closed under complementation. SIAM J. Comput. 17(5):1988;935-938.
11. Jenner B., Kirsig B. Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata. RAIRO - Inform. Théorique Appl./Theoret. Inform. Appl. 23(1):1989;87-99.
12. Ladner R.E., Lipton R.J., Stockmeyer L.J. Alternating pushdown and stack automata. SIAM J. Comput. 13(1):1984;135-155.
13. Ladner R., Lynch N. Relativization of questions about log space computability. Math. System Theory. 10:1976;19-32.
14. Ladner R.E., Stockmeyer L.J., Lipton R.J. Alternation bounded auxiliary pushdown automata. Inform. Control. 62:1984;93-108.
15. Lange K.-J., Reinhardt K. Empty alternation. Proc. 9th Conf. on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science. Vol. 841:1994;494-503 Springer, Kosice, Slovakia.
16. A. Newell, J.C. Shaw, Programming the logic theory machine, in: Proc. 1957 Western Joint Computer Conf., Institute of Radio Engineers, New York, 1957, pp. 230-240.
17. Papadimitriou C.H., Yannakakis M. The complexity of facets (and some facets of complexity). J. Comput. System Sci. 28(2):1984;244-259.
18. Papadimitriou C.H., Zachos S. Two remarks on the power of counting. Cremers A.B., Kriegel H.-P. Proc. 6th GI Conf. on Theoretical Computer Science. Lecture Notes in Computer Science. Vol. 145:1983;269-276 Springer, Dortmund, Germany.
19. Ruzzo W.L., Simon J., Tompa M. Space-bounded hierarchies and probabilistic computations. J. Comput. System Sci. 28(2):1984;216-230.
20. Savitch W.J. Relationships between nondeterministic and deterministic tape complexities. J. Comput. System Sci. 4(2):1970;177-192.
21. Sudborough I.H. On the tape complexity of deterministic context-free languages. J. ACM. 25(3):1978;405-414.
22. Szelepcsényi R. The method of forced enumeration for nondeterministic automata. Acta Inform. 26(3):1988;279-284.
23. Wagner K.W. Bounded query classes. SIAM J. Comput. 19(5):1990;833-846.
24. Wagner K., Wechsung G. Computational Complexity, Mathematics and its Applications (East Europeans series). 1986;VEB Deutscher Verlag der Wissenschaften, Berlin.