Advertisement

Abstract

The connections are established between full and bounded grammatical complexity measures of context-free languages for the case of Greibach normal form grammars and some known complexity measures.

Keywords

Normal Form Complexity Measure Matrix Algorithm Mathematical Institute Slovak Academy Phrase Structure Grammar 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Greibach, S.A., A new normal form theorem for context-free phrase structure grammars. J.Assoc.Comp.Mach. 12(1965), 42–52.Google Scholar
  2. 2.
    Gruska, J., Some classifications of context-free languages. Inf. and Control 14 (1969), 152–179.CrossRefGoogle Scholar
  3. 3.
    Gruska, J., On the size of context-free grammars. Kybernetika 8 (1972) 213–218.Google Scholar
  4. 4.
    Gruska, J., Descriptional complexity of context-free languages. Proceedings of MFCS 73 (1973), 71–83.Google Scholar
  5. 5.
    Hopcroft, J., Ullman, J., Formal languages and their relation to automata. Addision-Wesley Publishing Co. 1969.Google Scholar
  6. 6.
    Pirická, A., Complexity and Normal forms of CFL. Lecture Notes in Comp. Sci. 28 (1975), 292–297.Google Scholar
  7. 7.
    Pirická-Kelemenová, A., Bounded grammatical complexity of CFL. (submitted for publication).Google Scholar
  8. 8.
    Rosenkrantz, D., Matrix equations and normal forms for context-free grammars. J.Assoc.Comput.Mach.14, (1967), 501–507.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Alica Pirická-Kelemenová
    • 1
  1. 1.Mathematical Institute Slovak Academy of SciencesBratislavaCzechoslovakia

Personalised recommendations