On multi-head finite automata

Authors:
Arnold L. Rosenberg
Affiliations:
-
Venue:
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Year:
1965

Citing 0
Cited 4

On formalised computer programs

Journal of Computer and System Sciences
Subrecursive program schemata I & II: I. Undecidable equivalence problems; II. Decidable equivalence problems

Journal of Computer and System Sciences
Database query processing using finite cursor machines

ICDT'07 Proceedings of the 11th international conference on Database Theory
Automatic verification of parameterized data structures

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let mn be the class of languages defined by n-head finite automata. The Boolean and Kleene closure properties of mn are investigated, and a relationship between mn and the class sets of n-tuples of tapes defined by n-tape finite automata is established. The relationships among the multi-head languages and the context-free and context-sensitive languages are investigated, and the adage, "Two heads are better than one," is generalized. Several decision properties of the multi-head languages are derived.