Alternating Pushdown and Stack Automata
暂无分享,去创建一个
[1] Seymour Ginsburg,et al. Stack automata and compiling , 1967, JACM.
[2] Aviezri S. Fraenkel,et al. Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n , 1981, J. Comb. Theory, Ser. A.
[3] Harry R. Lewis,et al. Complexity Results for Classes of Quantificational Formulas , 1980, J. Comput. Syst. Sci..
[4] Stephen A. Cook,et al. Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.
[5] John C. Shepherdson,et al. The Reduction of Two-Way Automata to One-Way Automata , 1959, IBM J. Res. Dev..
[6] Dexter Kozen,et al. Complexity of Boolean Algebras , 1980, Theor. Comput. Sci..
[7] K. N. King. Measures of parallelism in alternating computation trees (Extended Abstract) , 1981, STOC '81.
[8] Richard E. Ladner,et al. Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..
[9] 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..
[10] Walter L. Ruzzo,et al. Tree-Size Bounded Alternation , 1980, J. Comput. Syst. Sci..
[11] Richard E. Ladner,et al. The Complexity of Problems in Systems of Communicating Sequential Processes , 1980, J. Comput. Syst. Sci..
[12] Jeffrey D. Ullman,et al. Nonerasing Stack Automata , 1967, J. Comput. Syst. Sci..