论文信息 - One-way multihead deterministic finite automata

One-way multihead deterministic finite automata

SummaryIt is shown that the family of languages recognized by one-way k head deterministic finite state automata ℒ(1 DFA(k)) and the family of languages recognized by one-way k head deterministic sensing finite state automata ℒ(1DSeFA(k)) are not closed under concatenation, Kleene star and reversal for k≧2. These results are obtained as consequences of a theorem giving a sufficient condition for a language L in order not to be in ℒ(1DSeFA(k)). Several further results above the classes ℒ(1DFA(k)) and ℒ(1DSeFA(k)) are simple consequences of this theorem.

Juraj Hromkovic | J. Hromkovic

[1] Arnold L. Rosenberg. On multi-head finite automata , 1965, SWCT.

[2] I. HAL SUDBOROUGH. One-Way Multihead Writing Finite Automata , 1976, Inf. Control..

[3] Andrew Chi-Chih Yao,et al. k+1 Heads Are Better than k , 1976, FOCS.

[4] Thomas Frank. Piatkowski. n-head finite state machines , 1963 .

[5] Juraj Hromkovic. Closure Properties of the Family of Languages Recognized by One-Way Two-Head Deterministic Finite State Automata , 1981, MFCS.

[6] Oscar H. Ibarra,et al. On 3-head versus 2-head finite automata , 1975, Acta Informatica.