The Effect of Inkdots for Two-Dimensional Automata
The Effect of Inkdots for Two-Dimensional Automata
复制标题
墨点对二维自动机的影响
DOI:
10.1142/s0218001495000328
复制
发表时间:
1995
期刊:
影响因子:
--
通讯作者:
Yue Wang
中科院分区:
文献类型:
--
作者:
A. Ito;Katsushi Inoue;I. Takanami;Yue Wang
Recently, related to the open problem of whether deterministic and nondeterministic space (especially lower-level) complexity classes are separated, the inkdot Turing machine was introduced. An inkdot machine is a conventional Turing machine capable of dropping an inkdot on a given input tape for a landmark, but not to pick it up nor further erase it. In this paper, we introduce a finite state version of the inkdot machine as a weak recognizer of the properties of digital pictures, rather than a Turing machine supplied with a one-dimensional working tape. We first investigate the sufficient spaces of three-way Turing machines to simulate two-dimensional inkdot finite automaton, as preliminary results. Next, we investigate the basic properties of two-dimensional inkdot automaton, i.e. the hierarchy based on the number of inkdots and the relationship of two-dimensional inkdot automata to other conventional two-dimensional automata. Finally, we investigate the recognizability of connected pictures of two-dimensional inkdot finite machines.