论文信息 - K + 1 heads are better than K

K + 1 heads are better than K

There are languages which can be recognized by a deterministic (k + 1)-headed oneway finite automaton but which cannot be recognized by a k-headed one-way (deterministic or non-deterministic) finite automaton. Furthermore, there is a language accepted by a 2-headed nondeterministic finite automaton which is accepted by no k-headed deterministic finite automaton.

Andrew Chi-Chih Yao | Ronald L. Rivest | A. Yao | R. Rivest

[1] Journal of the Association for Computing Machinery , 1961, Nature.

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

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

[4] Ivan Hal Sudborough,et al. Computation by multi-head writing finite automata , 1971 .

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