Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1975: Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975 pp 457–461Cite as

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

  • Communications
  • Conference paper
  • First Online:

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

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blum, M., A machine-independent theory of complexity of recursive functions. Journal ACM, 14, Nr. 2 (1967), 322–336.

    Article  Google Scholar 

  2. Cook, S.A., Characterizations of pushdown machines in terms of time bounded computers. Journal ACM, 18, Nr. 1 (1971), 4–18.

    Article  Google Scholar 

  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. Hartmanis, J. and Hopcroft, J.E., An overview of the theory of computational complexity. Journal ACM, 18, Nr. 3 (1971), 444–475.

    Article  Google Scholar 

  5. Hartmanis, J., Computational complexity of one-tape Turing machine computations. Journal ACM, 15, Nr. 2 (1968), 325–339.

    Article  Google Scholar 

  6. Hartmanis, J., Tape-reversal bounded Turing machine computations. Journal CSS, 2, Nr. 2 (1968), 117–135.

    Google Scholar 

  7. Salomaa, A., Formal Languages. Academic Press, New York and London, 1973.

    Google Scholar 

  8. Trachtenbrot, B.A., Turing machine computations with logarithmic delay. (Russian). Algebra i Logika 3 (1964), 33–48.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sektion Mathematik der Friedrich-Schiller-Universität Jena, Jena, DDR

    Gerd Wechsung

Authors
  1. Gerd Wechsung
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jíří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wechsung, G. (1975). Characterization of some classes of context-free languages in terms of complexity classes. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_233

Download citation

  • DOI: https://doi.org/10.1007/3-540-07389-2_233

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07389-5

  • Online ISBN: 978-3-540-37585-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation