{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T17:44:54Z","timestamp":1648575894412},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Patt. Recogn. Artif. Intell."],"published-print":{"date-parts":[[1995,10]]},"abstract":"<jats:p> 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. <\/jats:p><jats:p> 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. <\/jats:p>","DOI":"10.1142\/s0218001495000328","type":"journal-article","created":{"date-parts":[[2004,11,12]],"date-time":"2004-11-12T11:59:25Z","timestamp":1100260765000},"page":"777-796","source":"Crossref","is-referenced-by-count":1,"title":["THE EFFECT OF INKDOTS FOR TWO-DIMENSIONAL AUTOMATA"],"prefix":"10.1142","volume":"09","author":[{"given":"AKIRA","family":"ITO","sequence":"first","affiliation":[{"name":"Department of Computer Science and Systems Engineering Faculty of Engineering, Yamaguchi University Ube 755, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"KATSUSHI","family":"INOUE","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Systems Engineering Faculty of Engineering, Yamaguchi University Ube 755, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ITSUO","family":"TAKANAMI","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Systems Engineering Faculty of Engineering, Yamaguchi University Ube 755, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YUE","family":"WANG","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Systems Engineering Faculty of Engineering, Yamaguchi University Ube 755, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"container-title":["International Journal of Pattern Recognition and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218001495000328","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T02:12:43Z","timestamp":1565143963000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218001495000328"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10]]},"references-count":0,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1995,10]]}},"alternative-id":["10.1142\/S0218001495000328"],"URL":"https:\/\/doi.org\/10.1142\/s0218001495000328","relation":{},"ISSN":["0218-0014","1793-6381"],"issn-type":[{"value":"0218-0014","type":"print"},{"value":"1793-6381","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,10]]}}}