Space bounded computations: review and new separation results
MFCS '89 Selected papers of the symposium on Mathematical foundations of computer science
A note on three-dimensional alternating Turing machines with space smaller than log m
Information Sciences: an International Journal
Journal of the ACM (JACM)
Digital Picture Processing
Hi-index | 0.01 |
During the past about thirty-five years, many automata on a two- or three-dimensional input tape have been proposed and a lot of properties of such automata have been obtained. On the other hand, we think that recently, due to the advances in computer animation, motion image processing, and so forth, it is very useful for analyzing computational complexity of multi-dimensional information processing to explicate the properties of four-dimensional automata, i.e., three-dimensional automata with the time axis. In this paper, we propose a four-dimensional multi-inkdot finite automaton and mainly investigate its recognizability of four-dimensional connected pictures.