Skip to main content
SpringerLink
Log in
SpringerLink
Log in

On the height of derivation trees

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1979)

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

Included in the following conference series:

Abstract

Derivation trees generated by context-free grammars with regular parallel control language are considered. The generating function of the derivation trees counted according to height and length of yield is rational and the asymptotic behaviour of the average height is of the form g(n).n, g(n) periodic and bounded.

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. CULIK, K. and MAURER, H.A., Tree Controlled Grammars, Computing 19 (1977), 129–139.

    Google Scholar 

  2. DE BRUIJN, N.G., KNUTH, D.E. and RICE, S.O., The average height of planted plane trees, in Graph Theory and Computing (R.C. Read, ed.), Academic Press, 1972, 15–22.

    Google Scholar 

  3. KEMP, R., The average height of a derivation tree generated by a linear grammar in a special Chomskynormalform, Technical Report A78/O1, 1978, Universität des Saarlandes.

    Google Scholar 

  4. KNUTH, D.E., The Art of Computer Programming, Vol. 1: Fundamental Algorithms, Addison-Wesley, 1972.

    Google Scholar 

  5. KUICH, W., On the entropy of context-free languages, Information and Control 16 (1970), 173–200.

    Google Scholar 

  6. KUICH, W. and MAURER, H.A., On the structure generating function and entropy of tuple languages, Information and Control 19 (1971), 195–203

    Google Scholar 

  7. KUICH, W. and SHYAMASUNDAR, R.K., The structure generating function of some families of languages, Information and Control 32 (1976), 85–92.

    Google Scholar 

  8. ROZENBERG, G. and VERMEIR, D., On the Effect of the Finite Index Restriction on Several Families of Grammars. Information and Control 39 (1978), 284–302.

    Google Scholar 

  9. SALOMAA, A., Formal Languages, Academic Press, 1973.

    Google Scholar 

  10. SALOMAA, A. and SOITTOLA, M., Automata-Theoretic aspects of Formal Power Series, Springer, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematische Logik und Formale Sprachen Technische Universität Wien, Wien

    Werner Kuich, Helmut Prodinger & Friedrich J. Urbanek

Authors
  1. Werner Kuich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Helmut Prodinger
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Friedrich J. Urbanek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hermann A. Maurer

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kuich, W., Prodinger, H., Urbanek, F.J. (1979). On the height of derivation trees. In: Maurer, H.A. (eds) Automata, Languages and Programming. ICALP 1979. Lecture Notes in Computer Science, vol 71. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09510-1_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-09510-1_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09510-1

  • Online ISBN: 978-3-540-35168-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation