1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design (1964)

Nov. 11, 1964 to Nov. 13, 1964

pp: 76-81

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SWCT.1964.17

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.

INDEX TERMS

CITATION

A. L. Rosenberg, "On n-type finite state acceptors,"

*1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design(FOCS)*, vol. 00, no. , pp. 76-81, 1964.

doi:10.1109/SWCT.1964.17

CITATIONS