- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Knowledge Graph Search feature is available on CiNii Labs
- Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
Consideration on the Recognizability of Three-Dimensional Patterns
-
- Sun Chongyang
- Faculty of Engineering, University of Miyazaki
-
- Sakamoto Makoto
- Faculty of Engineering, University of Miyazaki
-
- Nagatomo Makoto
- Faculty of Engineering, University of Miyazaki
-
- Zhang Yu-an
- Faculty of Engineering, University of Miyazaki
-
- Yano Shinnosuke
- Faculty of Engineering, University of Miyazaki
-
- Ikeda Satoshi
- Faculty of Engineering, University of Miyazaki
-
- Ito Takao
- Institute of Engineering, Hiroshima University
-
- Ito Tsutomu
- Institute of Engineering, Hiroshima University
-
- Uchida Yasuo
- Department of Business Administration, Ube National College of Technology
-
- Yoshinaga Tsunehiro
- Department of Computer Science & Electronic Engineering, National Institute of Technology
Description
Due to the advances in computer vision, robotics, and so forth, it has become increasingly apparent that the study of three-dimensional pattern processing should be very important. Thus, the study of three-dimensional automata as the computational model of three-dimensional information processing has been significant. During the past about thirty years, automata on a three-dimensional tape have been obtained. On the other hand, it is well-known that whether or not the pattern on a two- or three-dimensional rectangular tape is connected can be decided by a deterministic onemarker finite automata. As far as we know, however, it is unknown whether a similar result holds for recognition of the connectedness of patterns on three-dimensional arbitrarily shaped tape. In this paper, we deal with the recognizability of three-dimensional patterns, and consider the recognizability of three-dimensional connected tapes by alternating Turing machines and arbitrarily shaped tapes by k marker finite automata.
Journal
-
- Proceedings of International Conference on Artificial Life and Robotics
-
Proceedings of International Conference on Artificial Life and Robotics 22 666-669, 2017-01-19
ALife Robotics Corporation Ltd.
- Tweet
Keywords
Details 詳細情報について
-
- CRID
- 1390564238096157056
-
- ISSN
- 21887829
-
- Text Lang
- en
-
- Data Source
-
- JaLC
- Crossref
- OpenAIRE
-
- Abstract License Flag
- Disallowed