@article{ITA_1980__14_1_67_0, author = {Monien, Burkhard}, title = {Two-way multihead automata over a one-letter alphabet}, journal = {RAIRO. Informatique th\'eorique}, pages = {67--82}, publisher = {EDP-Sciences}, volume = {14}, number = {1}, year = {1980}, mrnumber = {570039}, zbl = {0442.68039}, language = {en}, url = {http://archive.numdam.org/item/ITA_1980__14_1_67_0/} }
Monien, Burkhard. Two-way multihead automata over a one-letter alphabet. RAIRO. Informatique théorique, Tome 14 (1980) no. 1, pp. 67-82. http://archive.numdam.org/item/ITA_1980__14_1_67_0/
1. On Two-Way Multihead Automata, J. Comp. and System Sc., Vol. 7, 1973, pp. 28-37. | MR | Zbl
,2. 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 | Zbl
,3. Techniques for Separating Space Complexity Classes, J. Comp. and System Sc., Vol. 14, 1977, pp. 73-99. | MR | Zbl
,4. Relating Refined Space Complexity Classes, J. Comp. and System Sc., Vol. 14, 1977, pp. 100-129. | MR | Zbl
,5. Some Remarks on Multihead Automata, R.A.I.R.O. Informatique théorique, Vol. 11, 1977, pp. 181-195. | Numdam | MR | Zbl
,6. k+ 1 Heads are Better Than k, J. Ass. Comp. Machinery, Vol. 25, 1978, pp. 337-340. | MR | Zbl
and ,