Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Analysis of the non-context-free component of formal languages

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1976 (MFCS 1976)

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wechsung G., Characterization of some classes of context-free languages in terms of complexity classes. In Proceedings of MFCS 1975, Lecture Notes in Computer Science 32, p. 457–461.

    Google Scholar 

  2. Wechsung G., Kompliziertheitstheoretische Characterisierung der kontext-freien und linearen Sprachen, preprint.

    Google Scholar 

  3. Chytil M. P., On complexity of nondeterministic Turing machine computations. In Proceedings of MFCS 1975, Lecture Notes in Computer Science 32, p. 199–205.

    Google Scholar 

  4. Chytil M. P., Crossing-bounded computations and their relation to the LBA-problem, Kybernetika 12 (1976).

    Google Scholar 

  5. Blum M., A machine-independent theory of the complexity of recursive functions, JACM 14 (1967), 322–336.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Charles University, Malostranské nám. 25, 118 00, Prague 1 - M. Strana

    Michal P. Chytil

Authors
  1. Michal P. Chytil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Antoni Mazurkiewicz

Additional information

Dedicated to my teacher, Professor Jiří Bečvárř on the occasion of his fiftieth birthday.

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chytil, M.P. (1976). Analysis of the non-context-free component of formal languages. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_179

Download citation

  • DOI: https://doi.org/10.1007/3-540-07854-1_179

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07854-8

  • Online ISBN: 978-3-540-38169-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation