Some remarks on multihead automata
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 11 (1977) no. 3, pp. 181-195.
@article{ITA_1977__11_3_181_0,
     author = {Sudborough, I. H.},
     title = {Some remarks on multihead automata},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {181--195},
     publisher = {Centrale des revues, Dunod-Gauthier-Villars},
     address = {Montreuil},
     volume = {11},
     number = {3},
     year = {1977},
     zbl = {0369.68035},
     mrnumber = {474983},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1977__11_3_181_0/}
}
TY  - JOUR
AU  - Sudborough, I. H.
TI  - Some remarks on multihead automata
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1977
DA  - 1977///
SP  - 181
EP  - 195
VL  - 11
IS  - 3
PB  - Centrale des revues, Dunod-Gauthier-Villars
PP  - Montreuil
UR  - http://www.numdam.org/item/ITA_1977__11_3_181_0/
UR  - https://zbmath.org/?q=an%3A0369.68035
UR  - https://www.ams.org/mathscinet-getitem?mr=474983
LA  - en
ID  - ITA_1977__11_3_181_0
ER  - 
Sudborough, I. H. Some remarks on multihead automata. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 11 (1977) no. 3, pp. 181-195. http://www.numdam.org/item/ITA_1977__11_3_181_0/

1. A. V. Aho, J. E. Hopcroft and J. D. Ullman, Time and Tape Complexity of Pushdown Automata, Information and Control, 13, 3, 1968, 186-206. | Zbl 0257.68065

2. A. V. Aho, J. E. Hopcroft and J. D. Ullman, On the Computational Power of Pushdown Automata, J. Computer and System Sci., 4, 2, 1970, 129-136. | MR 266692 | Zbl 0207.01701

3. A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974. | MR 413592 | Zbl 0326.68005

4. C. Beeri, Reductions in the Number of Heads for the Nondeterminancy Problem in Multihead Automata, Technical Report, Institute of Mathematics, The Hebrew Institute of Jerusalem, Israel.

5. R. Book, Translational Lemmas, Polynomial Time, and (Log (n))j-Space, Theoretical Computer Science, 1, 1976, 215-226. | MR 405918 | Zbl 0326.68030

6. R. Book, Comparing Complexity Classes, J. Computer and System Sci., 9, 1974, 213-229. | MR 366099 | Zbl 0331.02020

7. S. A. Cook, Characterizations of Pushdown Machines in Terms of Time-Bounded Computers J. ACM, 18, 1971, 4-18. | MR 292605 | Zbl 0222.02035

8. S.A. Cook, An Observation on Time-Storage Trade Off, J. Computer and System Sci., 9, 1974, 308-316. | MR 398160 | Zbl 0306.68026

9. S. A. Cook and R. Sethi, Storage Requirements for Deterministic Polynomial Time Recognizable Languages, Sixth Annual ACM Symposium on Theory of Computing, 1974, 40-46. | MR 421161 | Zbl 0412.68078

10. S. A. Cook, Linear Time Simulation of Deterministic Two-Way Pushdown Automata, Proceedings of IFIP Congress, 1971, North Holland Publishers. | MR 400792 | Zbl 0255.68015

11. S. A. Cook and R. A. Reckhow, Time Bounded Rondom Access Machines, J. Computer and System Sci., 7, 1973, 354-375. | MR 327074 | Zbl 0284.68038

12. P. Flajolet and J. M. Steyaert, Decision Problems for Multihead Finite Automata, Proceedings of Symposium and Summer School on the Mathematical Foundations of Computer Science, High Tatras, Czechoslavakia, 1973, 225-230. | MR 408315

13. Z. Galil, Two-Way Deterministic Pushdown Automaton Languages and Some Open Problems in the Theory of Computation, Proceedings of Fifteenth Annual IEEE Symposium on Switching and Automata Theory, 1974, 170-177. | MR 414337

14. S. A. Greibach, The Hardest Context-Free Language, SIAM J. on Computing, 2, 1973, 304-310. | MR 334591 | Zbl 0278.68073

15. S. A. Greibach, A Note on the Recognition of One Counter Language, Revue Française d'Automatique, Informatique et Recherche Opérationnelle, 1975, 5-12. | Numdam | MR 391578

16. M. A. Harrison and O. H. Ibarra, Multitape and Multihead Pushdown Automata, Information and Control, 13, 1968, 433-470. | MR 238622 | Zbl 0174.02701

17. J. Hartmanis, On Nondeterminancy in Simple Computing Devices, Acta Informatica, 1, 1972, 336-344. | MR 317582 | Zbl 0229.68014

18. J. E. Hopcroft and J. D. Ullman, Formal Languages and Their Relation to Automata, Addison-Wesley, Reading, Mass., 1969. | MR 237243 | Zbl 0196.01701

19. O. H. Ibarra, On Two-Way Multihead Automata, J. Computer and System Sci., 7. 1973, 28-36. | MR 408317 | Zbl 0256.68028

20. O. H. Ibarra, Characterizations of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multihead and Auxiliary Stack Automata, J. Computer and System Sci., 5, 1971, 88-117. | MR 284290 | Zbl 0255.68012

21. N. D. Jones, Space-Bounded Reducibility among Combinational Problems, J. Computer and System Sci., 11, 1975, 68-85. | MR 398165 | Zbl 0317.02039

22. N. D. Jones and W. T. Laaser, Complete Problems for Deterministic Polynomial Time, Proceeding of Sixth Annual ACM Symposium on Theory of Computing, 1974, 33-39. | MR 438800 | Zbl 0376.68040

23. T. Kameda, Pushdown Automata with Counters, J. Computer and System Sci.,6, 1972. | MR 428804 | Zbl 0242.68022

24. T. Kasami, A Note on Computing Time for Recognition of Languages Generated by Linear Grammars, Information and Control, 10, 1967, 209-214. | Zbl 0163.01002

25. P. M. Lewis, R. E. Stearns and J. Hartmanis, Memory Bounds for the Recognition of Context-Free and Context-Sensitive Languages, Proceedings of Sixth Annual IEEE Conference on Switching Circuit Theory and Logical Design, 1965, 199-212. | Zbl 0272.68054

26. A. R. Meyer and L. J. Stockmeyer, Word Problems Requiring Exponential Time, Proceedings of Fifth Annual ACM Symposium on Theory of Computing, 1973, 1-9. | MR 418518 | Zbl 0359.68050

27. J. Seiferas, Nondeterministic Time and Space Complexity Classes, Ph. D. dissertation, MIT, 1974. Project Mac Report TR-137, MIT, Cambridge, Mass.

28. J. Seiferas, personal communication.

29. I. H. Sudborough, On Tape-Bounded Complexity Classes and Multihead Finite Automata, J. Computer and System Sci., 10, 1975. | MR 363832 | Zbl 0299.68031

30. I. H. Sudborough, On Deterministic Context-Free Languages, Multihead Automata, and the Power of an Auxiliary Pushdown Store, Proceedings of Eighth Annual ACM Symposium on Theory of Computing, 1976, 141-148. | MR 436674 | Zbl 0365.68077

31. L. Valiant, General Context-Free Recognition in Less than Cubic Time, J. Computer and System Sci., 10, 1975, 308-315. | MR 428796 | Zbl 0312.68042

32. R. Weicker, General Context Free Language Recognition by a RAM with Uniform Cost Criterion in Time n2log n, Technical Report No. 182, February, 1976, The Pennsylvania State University, University Park, Pa.