Abstract
In 1967, M. Blum and C. Hewitt first proposed two-dimensional automata as a computational model of two-dimensional pattern processing. Since then, many researchers in this field have been investigating the many properties of two- or three-dimensional automata. In 1977, C.R. Dyer and A. Rosenfeld introduced an acceptor on a two-dimensional pattern (or tape) called the pyramid cellular acceptor, and demonstrated that many useful recognition tasks are executed by pyramid cellular acceptors in a time which is proportional to the logarithm of the diameter of the input. They also introduced a bottom-up pyramid cellular acceptor, which is a restricted version of the pyramid cellular acceptor, and proposed some interesting open problems about bottom-up pyramid cellular acceptors. On the other hand, we think that the study of four-dimensional automata has been meaningful as the computational model of four-dimensional information processing such as computer animation, moving picture processing, and so forth. In this article, we investigate bottom-up pyramid cellular acceptors with four-dimensional layers, and show some of their accepting powers.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Blum M, Hewitt C (1967) Automata on a two-dimensional tape. IEEE Symposium on Switching and Automata Theory, pp 155–160
Dyer CR, Rosenfeld A (1977) Cellular pyramids for image analysis. Technical Report TR-544, Computer Science Center, University of Maryland
Inoue K, Nakamura A (1977) Some properties of two-dimensional on-line tessellation acceptors. Inform Sci 13:95–121
Inoue K, Takanami I, Nakamura A (1978) A note on two-dimensional finite automata. Inform Process Lett 7(1):49
Inoue K, Takanami I (1978) Remarks on two-dimensional finite automata with multiplication and bottom-up pyramid acceptors. Tech Rep IECE Jpn, No. AL77-61
Inoue K, Takanami I (1979) A note on bottom-up pyramid acceptors. Inform Process Lett 8(1):34–37
Sakamoto M, Nogami S, Inoue K, et al (2004) A relationship between the accepting powers of three-dimensional finite automata and time-bounded bottom-up pyramid cellular acceptors with three-dimensional layers. Trans SCI (Jpn) 17(10):451–458
Taniguchi H, Inoue K, Takanami I (1982) A note on three-dimensional finite automata. Inform Sci 26:65–85
Uchida Y, Ito T, Okabe H, et al (2008) Four-dimensional multi-ink-dot finite automata. WSEAS Trans Comput 7(9):1437–1446
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Uchida, Y., Ito, T., Sakamoto, M. et al. Bottom-up pyramid cellular acceptors with four-dimensional layers. Artif Life Robotics 16, 529–532 (2012). https://doi.org/10.1007/s10015-011-0988-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10015-011-0988-7