Complexity and minimality of context-free grammars and languages

  • A. Černý
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)


Complexity Measure Dependence Relation Algorithmic Problem Finite Alphabet Infinite Hierarchy 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ginsburg, S., The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York 1966Google Scholar
  2. 2.
    Gruska, J., Some Classifications of Context-Free Languages, Information and Control, 14 (1969) 152–179CrossRefGoogle Scholar
  3. 3.
    Gruska, J., On a Classification of Context-Free Languages, Kybernetika 3 (1967) 22–29Google Scholar
  4. 4.
    Gruska, J., Complexity and Unambiguity of Context-Free Grammars and Languages, Information and Control 18 (1971) 502–519CrossRefGoogle Scholar
  5. 5.
    Gruska, J., Descriptional Complexity of Context-Free Languages, Proc. MFCS'73, High Tatras, 71–83Google Scholar
  6. 6.
    Hopcroft, J. E., On the Equivalence and Containment Problems for Context-Free Languages, Math. Syst. Theory 3 (1969) 119–124CrossRefGoogle Scholar
  7. 7.
    Knuth, D. E., A Characterization of Parenthesis Languages, Information and Control 11 (1967) 269–289CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • A. Černý
    • 1
  1. 1.Department of Theoretical CyberneticsComenius UniversityBratislavaCzechoslovakia

Personalised recommendations