About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

First Page Preview
Bebják, Andrej ; Štefáneková, Ivana
Nondeterminism is essential for reversal-bounded two-way multihead finite automata. (English). Kybernetika, vol. 24 (1988), issue 1, pp. 65-71
MSC: 03D10, 03D15, 68Q05, 68Q15, 68Q25 | MR 936556 | Zbl 0648.68063
References:
[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 0245378 | Zbl 0199.31001
[2] J. Hartmanis: Tape reversal bounded Turing machines computations. J. Comput. System Sci. 19 (1979), 145-162. MR 0243947
[3] J. Hromkovič: One-way multihead deterministic finite automata. Acta Inform. 19 (1983), 377-384. MR 0717992
[4] J. Hromkovič: Fooling a two-way nondeterministic multihead automaton with reversal number restriction. Acta Inform. 22 (1985), 589-594. MR 0822328
[5] T. Kameda, R. Vollmar: Note on tape-reversal complexity of languages. Inform. and Control 17 (1970), 203-215. MR 0272565 | Zbl 0196.01801
[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 0400819 | Zbl 0337.02023
[8] A. C. Yao, R. L. Rivest: $K + 1$ heads are better than $K$. J. Assoc. Comput. Mach. 25 (1978), 337-340. MR 0483728 | Zbl 0372.68017
Partner of
EuDML logo