On n-type finite state acceptors
- 1 November 1964
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
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.Keywords
This publication has 4 references indexed in Scilit:
- Two-sided finite-state transductionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1963
- Regular Expressions and State Graphs for AutomataIEEE Transactions on Electronic Computers, 1960
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959
- The Reduction of Two-Way Automata to One-Way AutomataIBM Journal of Research and Development, 1959