Characterization of some classes of context-free languages in terms of complexity classes

  • Gerd Wechsung
Part of the Lecture Notes in Computer Science book series (LNCS, volume 32)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Blum, M., A machine-independent theory of complexity of recursive functions. Journal ACM, 14, Nr. 2 (1967), 322–336.CrossRefGoogle Scholar
  2. 2.
    Cook, S.A., Characterizations of pushdown machines in terms of time bounded computers. Journal ACM, 18, Nr. 1 (1971), 4–18.CrossRefGoogle Scholar
  3. 3.
    Ginsburg, S., Substitution and (semi-)AFL. Proceedings of symposium and summer school MFCS, High Tatras, September 3–8, 1973, 65–69.Google Scholar
  4. 4.
    Hartmanis, J. and Hopcroft, J.E., An overview of the theory of computational complexity. Journal ACM, 18, Nr. 3 (1971), 444–475.CrossRefGoogle Scholar
  5. 5.
    Hartmanis, J., Computational complexity of one-tape Turing machine computations. Journal ACM, 15, Nr. 2 (1968), 325–339.CrossRefGoogle Scholar
  6. 6.
    Hartmanis, J., Tape-reversal bounded Turing machine computations. Journal CSS, 2, Nr. 2 (1968), 117–135.Google Scholar
  7. 7.
    Salomaa, A., Formal Languages. Academic Press, New York and London, 1973.Google Scholar
  8. 8.
    Trachtenbrot, B.A., Turing machine computations with logarithmic delay. (Russian). Algebra i Logika 3 (1964), 33–48.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Gerd Wechsung
    • 1
  1. 1.Sektion Mathematik der Friedrich-Schiller-Universität JenaJenaDDR

Personalised recommendations