Nondeterminism and the size of two way finite automata
暂无分享,去创建一个
[1] Robert E. Tarjan,et al. A Combinatorial Problem Which Is Complete in Polynomial Space , 1976, JACM.
[2] Thomas J. Schaefer,et al. Complexity of decision problems based on finite two-person perfect-information games , 1976, STOC '76.
[3] Richard M. Karp,et al. Reducibility among combinatorial problems" in complexity of computer computations , 1972 .
[4] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..
[5] Stephen A. Cook,et al. Storage requirements for deterministic / polynomial time recognizable languages , 1974, STOC '74.
[6] A. R. Meyer,et al. Economy of Description by Automata, Grammars, and Formal Systems , 1971, SWAT.
[7] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[8] Stephen A. Cook,et al. Storage Requirements for Deterministic Polynomial Time Recognizable Languages , 1976, J. Comput. Syst. Sci..
[9] Neil D. Jones,et al. Complete problems for deterministic polynomial time , 1974, STOC '74.