Finite-Turn Repetitive Checking Automata and Sequential/ Parallel Matrix Languages

Authors:
P. S. -P. Wang
Affiliations:
GTE Research Laboratories
Venue:
IEEE Transactions on Computers
Year:
1981

Citing 5
Cited 0

Programmed Grammars and Classes of Formal Languages

Journal of the ACM (JACM)
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
Finite-turn checking automata

Journal of Computer and System Sciences
Checking automata and one-way stack languages

Journal of Computer and System Sciences

Quantified Score

Hi-index	14.98

Visualization

Abstract

A class of machines capable of recognizing two-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 FIRCA and (R:R)ML-the smallest class of the sequential/parallel matrix languages. Several closure properties are also investigated.