One-Pass Complexity of Digital Picture Properties
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Picture Languages: Formal Models for Picture Recognition
Picture Languages: Formal Models for Picture Recognition
Measures of parallelism in alternating computation trees (Extended Abstract)
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Formal languages and their relation to automata
Formal languages and their relation to automata
| Hi-index | 0.00 |
This paper introduces a two-dimensional alternating Turing machine (2-ATM) which is an extension of an alternating Turing machine to two-dimensions. This paper also introduces a three-way two-dimensional alternating Turing machine (TR2-ATM) which is an alternating version of a three-way two-dimensional Turing machine. We first investigate a relationship between the accepting powers of space-bounded 2-ATM's (or TR2-ATM's) and ordinary space-bounded two-dimensional Turing machines (or three-way two-dimensional Turing machines). We then introduce a simple, natural complexity measure for 2-ATM's (or TR2-ATM's), called -&-ldquo;leaf-size-&-rdquo;, and provides a spectrum of complexity classes based on leaf-size bounded computations. We finally investigate the recognizability of connected patterns by 2-ATM's (or TR2-ATM's).