论文信息 - Optimal simulation of two-dimensional alternating finite automata by three-way nondeterministic Turing machines

Optimal simulation of two-dimensional alternating finite automata by three-way nondeterministic Turing machines

Abstract We show that n log n space is sufficient for three-way nondeterministic Turing machines (3NTs) to simulate two-dimensional alternating finite automata (AFs), where n is the number of columns of rectangular input tapes. It is already known that n log n space is necessary for 3NTs to simulate AFs. Thus, our algorithm is optimal in the sense of space complexity point of view.

Katsushi Inoue | Itsuo Takanami | Akira Ito | Yue Wang

[1] Katsushi Inoue,et al. Deterministic Two-Dimensional On-Line Tessellation Acceptors are Equivalent to Two-Way Two-Dimensional Alternating Finite Automata Through 180°-Rotation , 1989, Theor. Comput. Sci..

[2] Tao Jiang,et al. Some Results Concerning 2-D On-Line Tessellation Acceptors and 2-D Alternating Finite Automata , 1994, Theor. Comput. Sci..

[3] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[4] Katsushi Inoue,et al. Two-Dimensional Alternating Turing Machines with Only Universal States , 1982, Inf. Control..

[5] Katsushi Inoue,et al. Two-Dimensional Alternating Turing Machines , 1983, Theor. Comput. Sci..

[6] Katsushi Inoue,et al. Relationships of accepting powers between cellular space with bounded number of state-changes and other automata , 1986, Systems and Computers in Japan.