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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
CULIK, K. and MAURER, H.A., Tree Controlled Grammars, Computing 19 (1977), 129–139.
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.
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.
KNUTH, D.E., The Art of Computer Programming, Vol. 1: Fundamental Algorithms, Addison-Wesley, 1972.
KUICH, W., On the entropy of context-free languages, Information and Control 16 (1970), 173–200.
KUICH, W. and MAURER, H.A., On the structure generating function and entropy of tuple languages, Information and Control 19 (1971), 195–203
KUICH, W. and SHYAMASUNDAR, R.K., The structure generating function of some families of languages, Information and Control 32 (1976), 85–92.
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.
SALOMAA, A., Formal Languages, Academic Press, 1973.
SALOMAA, A. and SOITTOLA, M., Automata-Theoretic aspects of Formal Power Series, Springer, 1978.
Author information
Authors and Affiliations
Editor information
Rights 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