Authors
Makoto Sakamoto, Makoto Nagatomo, Tuo Zhang, Xiaoyang Feng, Tatsuma Kurogi, Satoshi Ikeda, Masahiro Yokomichi, Hiroshi Furutani, Takao Ito, Yasuo Uchida, Tsunehiro Yoshinaga
Corresponding Author
Makoto Sakamoto
Available Online 30 June 2014.
DOI
https://doi.org/10.2991/jrnal.2014.1.1.15
Keywords
cellular acceptor, configuration-reader, converter, finite automaton, four-dimension, on-line tessellation acceptor, parallel/sequential array acceptor, Turing machine
Abstract
Blum and Hewitt first proposed two-dimensional automata as computational models of two-dimensional pattern processing?two-dimensional finite automata and marker automata, and investigated their pattern recognition abilities in 1967. Since then, many researchers in this field have investigated the properties of automata on two- or three-dimensional tapes. On the other hand, the question of whether or not processing four-dimensional digital patterns is more difficult than processing two- or three-dimensional ones is of great interest from both theoretical and practical standpoints. Thus, the study of four-dimensional automata as the computational models of four-dimensional pattern processing has been meaningful. From this point of view, we are interested in four-dimensional computational models, In this paper, we introduce a new four-dimensional computational model, k-neighborhood template A-type three-dimensional bounded cellular acceptor on four-dimensional input tapes, and investigate about hierarchy based on configuration-reader about this model.

Copyright
© 2013, the Authors. Published by ALife Robotics Corp. Ltd..
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF )