论文信息 - Three-way automata on rectangular tapes over a one-letter alphabet

Three-way automata on rectangular tapes over a one-letter alphabet

Abstract Necessary conditions for the languages recognized by three-way automata on tapes over a one-letter alphabet are obtained. These conditions have a simple algebraic form. Using these conditions, nondeterministic three-way automata are proved to be more powerful than deterministic automata and various decision problems for the three-way automata are solved.

Efim B. Kinber

[1] Azriel Rosenfeld,et al. Picture languages: Formal models for picture recognition , 1979 .

[2] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[3] Marvin Minsky,et al. Computation : finite and infinite machines , 2016 .

[4] 高浪五男,et al. A Note on Decision Problems for Three-Way Two-Dimensional Finite Automata (情報科学の数学的基礎理論と応用) , 1979 .

[5] Katsushi Inoue,et al. Two-dimensional finite automata and unacceptable functions , 1979 .

[6] Azriel Rosenfeld. Sequential and Parallel Picture Acceptors. , 1977 .

[7] M. Blum,et al. Automata on a 2-Dimensional Tape , 1967, SWAT.