|
Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 2001, Volume 8, Issue 3, Pages 26–45
(Mi da224)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
A lower bound for the coding cost and the asymptotically optimal coding of stochastic context-free languages
L. P. Zhil'tsova Nizhny Novgorod State Pedagogical University
Abstract:
We consider a language generated by a stochastic context-free grammar with unique derivation for which the matrix of first moments is indecomposable, nonperiodic, and its Perron root is strictly less than one. For such a language we obtain an unimprovable lower bound for the binary coding cost. We also construct an algorithm for asymptotically optimal coding.
Received: 06.06.2001
Citation:
L. P. Zhil'tsova, “A lower bound for the coding cost and the asymptotically optimal coding of stochastic context-free languages”, Diskretn. Anal. Issled. Oper., Ser. 1, 8:3 (2001), 26–45
Linking options:
https://www.mathnet.ru/eng/da224 https://www.mathnet.ru/eng/da/v8/s1/i3/p26
|
Statistics & downloads: |
Abstract page: | 429 | Full-text PDF : | 171 |
|