This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Finite-Turn Repetitive Checking Automata and Sequential/ Parallel Matrix Languages
May 1981 (vol. 30 no. 5)
pp. 366-370
P.S.-P. Wang, GTE Research Laboratories
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.
Index Terms:
row(column) Kleene's closure, Automata, instantaneous description, matrix languages, row(column) catenation
Citation:
P.S.-P. Wang, "Finite-Turn Repetitive Checking Automata and Sequential/ Parallel Matrix Languages," IEEE Transactions on Computers, vol. 30, no. 5, pp. 366-370, May 1981, doi:10.1109/TC.1981.1675797
Usage of this product signifies your acceptance of the Terms of Use.