Detection of interlocking components in three-dimensional digital pictures
Information Sciences: an International Journal
A note on three-way two-dimensional alternating Turing machines
Information Sciences: an International Journal
Alternating multihead finite automata
Theoretical Computer Science
On three-way two-dimensional multicounter automata
Information Sciences: an International Journal
A survey of two-dimensional automata theory
Information Sciences: an International Journal
On space-bounded synchronized alternating Turing machines
Theoretical Computer Science
Theoretical Computer Science - Special issue on logic and applications to computer science
A note on three-dimensional alternating Turing machines with space smaller than log m
Information Sciences: an International Journal
Some Results on Tape-Bounded Turing Machines
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Picture Languages: Formal Models for Picture Recognition
Picture Languages: Formal Models for Picture Recognition
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Digital Picture Processing
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Some Results Concerning Two-Dimensional Turing Machines and Finite Automata
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Measures of parallelism in alternating computation trees (Extended Abstract)
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
On the capability of finite automata in 2 and 3 dimensional space
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Four-dimensional multi-inkdot finite automata
WSEAS Transactions on Computers
Automata on a 2-dimensional tape
FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)
Hierarchies of memory limited computations
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Hi-index | 0.00 |
The recent advances in computer animation, motion image processing, robotics and so on prompted us to analyze computational complexity of four-dimensional pattern processing. Thus, the research of four-dimensional automata as a computational model of four-dimensional pattern processing has also been meaningful. From this viewpoint, we introduced a four-dimensional alternating Turing machine (4-ATM) operating in parallel. In this paper, we continue the investigations about 4-ATM's, deal with a four-dimensional synchronized alternating Turing machine (4-SATM), and investigate some properties of 4-SATM's which each sidelength of each input tape is equivalent. The main topics of this paper are: (1) hierarchies based on the number of processes of 4-SATM's, and (2) recognizability of connected pictures by 4-SATM's.