R69-18 Multitape One-Way Nonwriting Automata

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.