Two-Dimensional Alternating Turing Machines with Only Universal States
暂无分享,去创建一个
[1] Katsushi Inoue,et al. Two-Dimensional Alternating Turing Machines , 1983, Theor. Comput. Sci..
[2] M. Blum,et al. Automata on a 2-Dimensional Tape , 1967, SWAT.
[3] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[4] Wolfgang J. Paul,et al. On alternation , 1980, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[5] Katsushi Inoue,et al. A note on closure properties of the classes of sets accepted by tape-bounded two-dimensional turing machines , 1978, Inf. Sci..
[6] Katsushi Inoue,et al. A note on deterministic three-way tape-bounded two-dimensional Turing machines , 1980, Inf. Sci..
[7] Jeffrey D. Ullman,et al. Some Results on Tape-Bounded Turing Machines , 1969, JACM.
[8] Walter L. Ruzzo,et al. Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..
[9] Katsushi Inoue,et al. Some properties of two-dimensional on-line tessellation acceptors , 1977, Inf. Sci..
[10] Ivan Hal Sudborough,et al. Efficient algorithms for path system problems and applications to alternating and time-space complexity classes , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[11] Katsushi Inoue,et al. Three-way tape-bounded two-dimensional turing machines , 1979, Inf. Sci..
[12] Azriel Rosenfeld,et al. Picture languages: Formal models for picture recognition , 1979 .
[13] Richard J. Lipton,et al. Alternating Pushdown Automata (Preliminary Report) , 1978, FOCS.