Alternating Tree Automata

[1]  Tsutomu Kamimura,et al.  Tree Automata and Attribute Grammars , 1983, Inf. Control..

[2]  Giora Slutzki,et al.  Parallel and Two-Way Automata on Directed Ordered Acyclic Graphs , 1981, Inf. Control..

[3]  Joost Engelfriet,et al.  Tree transducers, L systems and two-way machines (Extended Abstract) , 1978, J. Comput. Syst. Sci..

[4]  Dexter Kozen,et al.  Complexity of Boolean Algebras , 1980, Theor. Comput. Sci..

[5]  A. K. Chandra,et al.  Provably Difficult Combinatorial Games , 1979, SIAM J. Comput..

[6]  Shigeki Iwata,et al.  Classes of pebble games and complete problems , 1979, ACM '78.

[7]  Richard J. Lipton,et al.  Alternating Pushdown Automata (Preliminary Report) , 1978, FOCS.

[8]  Leonard Berman,et al.  Precise bounds for presburger arithmetic and the reals with addition: Preliminary report , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[9]  Richard E. Ladner,et al.  Propositional modal logic of programs , 1977, STOC '77.

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

[11]  John Doner,et al.  Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..

[12]  J. M. Foster,et al.  Mathematical theory of automata , 1965 .