This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
July 1969 (vol. 18 no. 7)
pp. 669
S.A. Greibach, Harvard University
A multitape one-way nonwriting automaton (MONA) is a finite state machine with a finite number of one-way input tapes which are advanced independently. This paper summarizes closure properties and decision problems of both deterministic and nondeterministic varieties. The family of n-ary word relations defined by deterministic (nondeterministic) n-tape MONA's is called Dn(Nn). Clearly D1 = N1 = regular sets and requires no further comment.
Citation:
S.A. Greibach, "R69-18 Multitape One-Way Nonwriting Automata," IEEE Transactions on Computers, vol. 18, no. 7, pp. 669, July 1969, doi:10.1109/T-C.1969.222741
Usage of this product signifies your acceptance of the Terms of Use.