论文信息 - On Probabilistic Context-Free Grammars that Achieve Capacity

On Probabilistic Context-Free Grammars that Achieve Capacity

Probabilistic grammars acting as information sources are considered and concepts from information theory defined by other authors are partly redefined. A specific probability assignment for maximizing the rate of a language source is found. Further, the problem of coding a language source is treated.

Jørn Justesen | Knud J. Larsen

[1] Taylor L. Booth,et al. Applying Probability Measures to Abstract Languages , 1973, IEEE Transactions on Computers.

[2] R. Gallager. Information Theory and Reliable Communication , 1968 .

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

[4] Stephen Soule,et al. Entropies of Probabilistic Grammars , 1974, Inf. Control..

[5] A. Duijvestijn,et al. Electronic computation of squared rectangles , 1962 .

[6] T. E. Harris,et al. The Theory of Branching Processes. , 1963 .

[7] Sandra E. Hutchins. Moments of string and derivation lengths of stochastic context-free grammars , 1972, Inf. Sci..

[8] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1951 .

[9] D. A. Bell,et al. Information Theory and Reliable Communication , 1969 .