Paper Info
Title
Hierarchy Based On Configuration-Reader About K-Neighborhood Template A-Type Three-Dimensional Bounded Cellular Acceptor
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.
Year
DOI
Venue
2014
10.2991/jrnal.2014.1.1.15
JOURNAL OF ROBOTICS NETWORKING AND ARTIFICIAL LIFE
Keywords
DocType
Volume
cellular acceptor, configuration-reader, converter, finite automaton, four-dimension, on-line tessellation acceptor, parallel/sequential array acceptor, Turing machine
Journal
1
Issue
ISSN
Citations 
1
2352-6386
0
PageRank 
References 
Authors
0.34
0
11
Name
Order
Citations
PageRank
Makoto Sakamoto12516.45
Makoto Nagatomo200.68
Tuo Zhang323332.92
Xiaoyang Feng400.68
Tatsuma Kurogi500.68
Satoshi Ikeda602.03
Masahiro Yokomichi700.68
Hiroshi Furutani85422.85
takao ito902.37
Yasuo Uchida1056.05
Tsunehiro Yoshinaga1166.98