Abstract
Recently, related to the open problem whether deterministic and nondeterministic space (especially lower-level) complexity classes are separated, inkdot Turing machines were introduced. On the other hand, due to the advances in many application areas about three-dimensional information processing, the research on three-dimensional automata as the computation of three-dimensional pattern processing has been meaningful. From this viewpoint, we propose a three-dimensional multiinkdot automata, and investigate some properties of three-dimensional multiinkdot automata.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
This work was presented, in part, at the 9th International Symposium on Artificial Life and Robotics, Oita, Japan, January 28–30, 2004
About this article
Cite this article
Makino, T., Okabe, H., Taniguchi, S. et al. Three-dimensional multiinkdot automata. Artif Life Robotics 9, 99–101 (2005). https://doi.org/10.1007/s10015-004-0327-3
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10015-004-0327-3