The Community for Technology Leaders
RSS Icon
Subscribe
Nov. 11, 1964 to Nov. 13, 1964
pp: 76-81
ABSTRACT
Certain properties of three variants of the multi-tape automata of Rabin and Scott are proved. Closure properties of the defined sets of n-tuples are found, and the nature of projections of the defined sets of n-tuples on one coordinate is studied. Some necessary conditions for acceptance are derived, and a characterization of the sets of n-tuples defined by non-deterministic n-tape automata is found. The results in the paper generalize and supplement the results of Rabin and Scott.
CITATION
Arnold L. Rosenberg, "On n-type finite state acceptors", FOCS, 1964, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 1964, pp. 76-81, doi:10.1109/SWCT.1964.17
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool