On the height of derivation trees
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.
KeywordsAverage Height Formal Power Series Derivation Tree Finite Deterministic Automaton Finite Control
Unable to display preview. Download preview PDF.
- CULIK, K. and MAURER, H.A., Tree Controlled Grammars, Computing 19 (1977), 129–139.Google Scholar
- 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
- 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
- KNUTH, D.E., The Art of Computer Programming, Vol. 1: Fundamental Algorithms, Addison-Wesley, 1972.Google Scholar
- KUICH, W., On the entropy of context-free languages, Information and Control 16 (1970), 173–200.Google Scholar
- KUICH, W. and MAURER, H.A., On the structure generating function and entropy of tuple languages, Information and Control 19 (1971), 195–203Google Scholar
- KUICH, W. and SHYAMASUNDAR, R.K., The structure generating function of some families of languages, Information and Control 32 (1976), 85–92.Google Scholar
- 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
- SALOMAA, A., Formal Languages, Academic Press, 1973.Google Scholar
- SALOMAA, A. and SOITTOLA, M., Automata-Theoretic aspects of Formal Power Series, Springer, 1978.Google Scholar