Advertisement

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

  • Michal P. Chytil
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 45)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    Wechsung G., Kompliziertheitstheoretische Characterisierung der kontext-freien und linearen Sprachen, preprint.Google Scholar
  3. 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. 4.
    Chytil M. P., Crossing-bounded computations and their relation to the LBA-problem, Kybernetika 12 (1976).Google Scholar
  5. 5.
    Blum M., A machine-independent theory of the complexity of recursive functions, JACM 14 (1967), 322–336.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • Michal P. Chytil
    • 1
  1. 1.Charles UniversityPrague 1 - M. Strana

Personalised recommendations