Advertisement

Alternating multihead finite automata

Extended abstract
  • K. N. King
Session 15: A. Pnueci, Chairman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 115)

References

  1. 1.
    A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer, Alternation, JACM 28 (1981), 114–133.Google Scholar
  2. 2.
    A. K. Chandra and L. J. Stockmeyer, Alternation, Conf. Rec. IEEE 17th Ann. Symp. on Found. of Comp. Sci. (1976), 98–108.Google Scholar
  3. 3.
    S. A. Cook, Characterizations of pushdown machines in terms of time-bounded computers, JACM 18 (1971), 4–18.Google Scholar
  4. 4.
    S. A. Cook, Linear time simulation of deterministic two-way pushdown automata, in Information Processing 71, North-Holland, Amsterdam (1972).Google Scholar
  5. 5.
    S. A. Cook, An observation on time-space trade-off, J. Comput. Sys. Sci. 9 (1974), 308–316.Google Scholar
  6. 6.
    Z. Galil, Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages, Math. Systems Theory 10 (1977), 211–228.Google Scholar
  7. 7.
    M. A. Harrison and O. H. Ibarra, Multi-tape and multi-head pushdown automata, Inform. Control 13 (1968), 433–470.Google Scholar
  8. 8.
    J. Hartmanis, On non-determinancy in simple computing devices, Acta Inform. 1 (1972), 336–344.Google Scholar
  9. 9.
    O. H. Ibarra, On two-way multihead automata, J. Comput. Sys. Sci. 7 (1973), 28–36.Google Scholar
  10. 10.
    N. D. Jones, Space-bounded reducibility among combinatorial problems, J. Comput. Sys. Sci. 11 (1975), 68–85.Google Scholar
  11. 11.
    N. D. Jones and W. T. Laaser, Complete problems for deterministic polynomial time, Theoretical Computer Science 3 (1977), 105–117.Google Scholar
  12. 12.
    T. Kameda, Pushdown automata with counters, J. Comput. Sys. Sci. 6 (1972), 138–150.Google Scholar
  13. 13.
    D. Kozen, On parallelism in Turing machines, Conf. Rec. IEEE 17th Ann. Symp. on Found. of Comp. Sci. (1976), 89–97.Google Scholar
  14. 14.
    R. E. Ladner, R. J. Lipton, and L. J. Stockmeyer, Alternating pushdown automata, Conf. Rec. IEEE 19th Ann. Symp. on Found. of Comp. Sci. (1978), 92–106.Google Scholar
  15. 15.
    B. Monien, Characterizations of time-bounded computations by limited primitive recursion, Second Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science 14, Springer-Verlag (1974), 280–293.Google Scholar
  16. 16.
    B. Monien, Transformational methods and their application to complexity problems, Acta Inform. 6 (1976), 95–108. Corrigendum, Acta Inform. 8 (1977), 383–384.Google Scholar
  17. 17.
    B. Monien, Two-way multihead automata over a one-letter alphabet, R.A.I.R.O. Informatique théorique 14 (1980), 67–82.Google Scholar
  18. 18.
    B. Monien and I. H. Sudborough, The interface between language theory and complexity theory, in ‘Formal Language Theory: Perspectives and Open Problems,’ R. V. Book, ed., Academic Press, New York, 1980, pp. 287–323.Google Scholar
  19. 19.
    J. I. Seiferas, Techniques for separating space complexity classes, J. Comput. Sys. Sci. 14 (1977), 73–99.Google Scholar
  20. 20.
    J. I. Seiferas, Relating refined space complexity classes, J. Comput. Sys. Sci. 14 (1977), 100–129.Google Scholar
  21. 21.
    I. H. Sudborough, On tape-bounded complexity classes and multihead finite automata, J. Comput. Sys. Sci. 10 (1975), 62–76.Google Scholar
  22. 22.
    I. H. Sudborough, On deterministic context-free languages, multihead automata, and the power of an auxiliary pushdown store, Proc. 8th Ann. Symp. on Theory of Computing (1976), 141–148.Google Scholar
  23. 23.
    I. H. Sudborough, Separating tape bounded auxiliary pushdown automata classes, Proc. 9th Ann. Symp. on Theory of Computing (1977), 208–217.Google Scholar
  24. 24.
    I. H. Sudborough, Some remarks on multihead automata, R.A.I.R.O. Informatique théorique 11 (1977), 181–195.Google Scholar
  25. 25.
    A. C. Yao and R. L. Rivest, k + 1 heads are better than k, JACM 25 (1978), 337–340.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • K. N. King
    • 1
  1. 1.School of Information and Computer ScienceGeorgia Institute of TechnologyAtlantaU.S.A.

Personalised recommendations