Skip to main content
Conference Proceedings

On the height of derivation trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1979) 71 LNCS 370-384
DOI: 10.1007/3-540-09510-1_30
6Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Kuich, W., Prodinger, H., & Urbanek, F. J. (1979). On the height of derivation trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 71 LNCS, pp. 370–384). Springer Verlag. https://doi.org/10.1007/3-540-09510-1_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free