Two-way multihead automata over a one-letter alphabet
Monien, Burkhard
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 14 (1980), p. 67-82 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1980-01-01
@article{ITA_1980__14_1_67_0,
     author = {Monien, Burkhard},
     title = {Two-way multihead automata over a one-letter alphabet},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {14},
     year = {1980},
     pages = {67-82},
     mrnumber = {570039},
     zbl = {0442.68039},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1980__14_1_67_0}
}

Monien, Burkhard. Two-way multihead automata over a one-letter alphabet. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 14 (1980) pp. 67-82. http://gdmltest.u-ga.fr/item/ITA_1980__14_1_67_0/

1. O. H. Ibarra, On Two-Way Multihead Automata, J. Comp. and System Sc., Vol. 7, 1973, pp. 28-37. | MR 408317 | Zbl 0256.68028

2. B. Monien, Transformational Methods and Their Application to Complexity Problems, Acta Informatica, Vol. 6, 1976, pp. 95-108; Corrigenda, Acta Informatica, Vol. 8, 1977, pp. 383-384. | MR 403312 | Zbl 0365.02026

3. J. I. Seiferas, Techniques for Separating Space Complexity Classes, J. Comp. and System Sc., Vol. 14, 1977, pp. 73-99. | MR 495207 | Zbl 0352.68062

4. J. I. Seiferas, Relating Refined Space Complexity Classes, J. Comp. and System Sc., Vol. 14, 1977, pp. 100-129. | MR 495208 | Zbl 0352.68063

5. I. H. Sudborough, Some Remarks on Multihead Automata, R.A.I.R.O. Informatique théorique, Vol. 11, 1977, pp. 181-195. | Numdam | MR 474983 | Zbl 0369.68035

6. A. C. Yao and R. L. Rivest, k+ 1 Heads are Better Than k, J. Ass. Comp. Machinery, Vol. 25, 1978, pp. 337-340. | MR 483728 | Zbl 0372.68017