Skip to main content
SpringerLink
Log in

Greibach normal form complexity

  • Communications
  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975 (MFCS 1975)

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

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.

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. 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. Gruska, J., Some classifications of context-free languages. Inf. and Control 14 (1969), 152–179.

    Article  Google Scholar 

  3. Gruska, J., On the size of context-free grammars. Kybernetika 8 (1972) 213–218.

    Google Scholar 

  4. Gruska, J., Descriptional complexity of context-free languages. Proceedings of MFCS 73 (1973), 71–83.

    Google Scholar 

  5. Hopcroft, J., Ullman, J., Formal languages and their relation to automata. Addision-Wesley Publishing Co. 1969.

    Google Scholar 

  6. Pirická, A., Complexity and Normal forms of CFL. Lecture Notes in Comp. Sci. 28 (1975), 292–297.

    Google Scholar 

  7. Pirická-Kelemenová, A., Bounded grammatical complexity of CFL. (submitted for publication).

    Google Scholar 

  8. Rosenkrantz, D., Matrix equations and normal forms for context-free grammars. J.Assoc.Comput.Mach.14, (1967), 501–507.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute Slovak Academy of Sciences, Obrancov mieru 41, 886 25, Bratislava, Czechoslovakia

    Alica Pirická-Kelemenová

Authors
  1. Alica Pirická-Kelemenová
    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

Pirická-Kelemenová, A. (1975). Greibach normal form complexity. 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_219

Download citation

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

  • 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