On the height of derivation trees

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 paper is not available on this server.
(Back to List of Papers)