Multihead finite state automata am concatenation
The class of languages accepted by the one-way nondeterministic simple k-head finite automata ℒ(NSPk-HFA) is not closed under concatenation for any k≥2.
The class k U ℒ(NSPk-HFA) is closed under concatenation.
The class of languages recognized by one-way k-head deterministic finite state automata ℒ(1DFA(k)) and the class of languages recognized by one-way k-head deterministic sensing finite state automata ℒ(1DSeFA(k)) are not closed under concatenation, Kleene star and reversal.
KeywordsFinite State Machine Finite Automaton Finite State Automaton Input Word Input Alphabet
Unable to display preview. Download preview PDF.
- 5.T.F. Piatkowski, N — head finite state machines, Ph. D. Dissertation, University of Michigan 1963.Google Scholar
- 7.A. L. Rosenberg, Nonwriting extensions of finite automata, Ph. D. Dissertation, Harward University (1965).Google Scholar
- 10.J. Hromkovic, Closure properties of the family of languages recognized by one-way two-head deterministic finite state automata, in Proceedings of the 10th International Symposium MFC`S81, Lecture Notes in Computer Science 118, Springer Verlag 1981, 304–313.Google Scholar