论文信息 - On the Height of Derivation Trees

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.

[1] Hermann A. Maurer,et al. The Structure Generating Function and Entropy of Tuple Languages , 1971, Inf. Control..

[2] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[3] R. K. Shyamasundar,et al. The Structure Generating Function of Some Families of Languages , 1976, Inf. Control..

[4] Werner Kuich,et al. On the Entropy of Context-Free Languages , 1970, Inf. Control..

[5] Grzegorz Rozenberg,et al. On the Effect of the Finite Index Restriction on Several Families of Grammars , 1978, Inf. Control..

[6] de Ng Dick Bruijn,et al. THE AVERAGE HEIGHT OF PLANTED PLANE TREES , 1972 .

[7] Arto Salomaa,et al. Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.