Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
Journal of the ACM (JACM)
One-Pass Complexity of Digital Picture Properties
Journal of the ACM (JACM)
Syntax-directed interpretation of classes of pictures
Communications of the ACM
Formal properties of sequential/parallel matrix languages
ACM '76 Proceedings of the 1976 annual conference
Formal languages and their relation to automata
Formal languages and their relation to automata
| Hi-index | 0.00 |
A class of machines capable of recognizing 2-dimensional sequential/parallel matrix languages is introduced. It is called “finite-turn repetitive checking automata” (FTRCA). This checking automaton is provided with three read-write heads, one read only head and a control register in its memory to keep track of the internal transition states and the stack symbols. The value of the register ranges from 0 to a finite positive integer k and can repetitively appear as many times as necessary. A one-to-one correspondence is established between the class of FTRCA and (R:R)ML - the smallest class of the sequential/parallel matrix languages.