Characterizing The Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata
暂无分享,去创建一个
[1] Neil Immerman. Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..
[2] Ivan Hal Sudborough,et al. On the Tape Complexity of Deterministic Context-Free Languages , 1978, JACM.
[3] Allan Borodin,et al. Two applications of complementation via inductive counting , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.
[4] Stephen A. Cook,et al. Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.
[5] Richard J. Lipton,et al. Alternating Pushdown Automata (Preliminary Report) , 1978, FOCS.
[6] Richard J. Lipton,et al. Alternation Bounded Auxiliary Pushdown Automata , 1984, Inf. Control..
[7] Larry J. Stockmeyer,et al. The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..
[8] Sheila A. Greibach,et al. Checking Automata and One-Way Stack Languages , 1969, J. Comput. Syst. Sci..
[9] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .