DocumentCode
1102987
Title
R69-18 Multitape One-Way Nonwriting Automata
Author
Greibach, S.A.
Issue
7
fYear
1969
fDate
7/1/1969 12:00:00 AM
Firstpage
669
Lastpage
669
Abstract
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.
Keywords
Autobiographies; Automata; Automatic control; Formal languages; Magnetic heads; Pathology;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1969.222741
Filename
1671334
Link To Document