A Grammatical Characterization of Alternating Pushdown Automata

Abstract The notion of an alternating context-free grammar is introduced and it is shown that the class of alternating context-free languages is equal to the class of languages accepted by alternating pushdown automata. Some properties on alternating context-free languages are also studied.

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

[2]  Giora Slutzki,et al.  Alternating Tree Automata , 1983, Theor. Comput. Sci..

[3]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[4]  Juraj Hromkovic.  On the Power of Alternation in Automata Theory , 1985, J. Comput. Syst. Sci..

[5]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

[6]  Dexter Kozen,et al.  On parallelism in turing machines , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[7]  Seymour Ginsburg,et al.  One-way stack automata , 1967, JACM.

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