Geodesic
Nondeterminism is essential for reversal-bounded two-way multihead finite automata
Kybernetika, Tome 24 (1988) no. 1, pp. 65-71 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 03D10, 03D15, 68Q05, 68Q15, 68Q25 
@article{KYB_1988_24_1_a7,
     author = {Bebj\'ak, Andrej and \v{S}tef\'anekov\'a, Ivana},
     title = {Nondeterminism is essential for reversal-bounded two-way multihead finite automata},
     journal = {Kybernetika},
     pages = {65--71},
     year = {1988},
     volume = {24},
     number = {1},
     mrnumber = {936556},
     zbl = {0648.68063},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_1988_24_1_a7/}
}
TY  - JOUR
AU  - Bebják, Andrej
AU  - Štefáneková, Ivana
TI  - Nondeterminism is essential for reversal-bounded two-way multihead finite automata
JO  - Kybernetika
PY  - 1988
SP  - 65
EP  - 71
VL  - 24
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/KYB_1988_24_1_a7/
LA  - en
ID  - KYB_1988_24_1_a7
ER  - 
%0 Journal Article
%A Bebják, Andrej
%A Štefáneková, Ivana
%T Nondeterminism is essential for reversal-bounded two-way multihead finite automata
%J Kybernetika
%D 1988
%P 65-71
%V 24
%N 1
%U http://geodesic.mathdoc.fr/item/KYB_1988_24_1_a7/
%G en
%F KYB_1988_24_1_a7
Bebják, Andrej; Štefáneková, Ivana. Nondeterminism is essential for reversal-bounded two-way multihead finite automata. Kybernetika, Tome 24 (1988) no. 1, pp. 65-71. http://geodesic.mathdoc.fr/item/KYB_1988_24_1_a7/

[1] P. C. Fischer: The reduction of tape reversals for off-line one-tape Turing machines. J. Comput. System Sci. 2 (1968), 136-147. | MR | Zbl

[2] J. Hartmanis: Tape reversal bounded Turing machines computations. J. Comput. System Sci. 19 (1979), 145-162. | MR

[3] J. Hromkovič: One-way multihead deterministic finite automata. Acta Inform. 19 (1983), 377-384. | MR

[4] J. Hromkovič: Fooling a two-way nondeterministic multihead automaton with reversal number restriction. Acta Inform. 22 (1985), 589-594. | MR

[5] T. Kameda, R. Vollmar: Note on tape-reversal complexity of languages. Inform. and Control 17 (1970), 203-215. | MR | Zbl

[6] T. F. Piatkowski: N-head Finite State Machines. Ph. D. Dissertation. University of Michigan 1963.

[7] I. H. Sudborough: One-way multihead writing finite automata. Inform. and Control 30 (1976), 1-20. | MR | Zbl

[8] A. C. Yao, R. L. Rivest: $K + 1$ heads are better than $K$. J. Assoc. Comput. Mach. 25 (1978), 337-340. | MR | Zbl