Geodesic
A~lower bound for the coding cost and the asymptotically optimal coding of stochastic context-free languages
Diskretnyj analiz i issledovanie operacij, Tome 8 (2001) no. 3, pp. 26-45.

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{DA_2001_8_3_a2,
     author = {L. P. Zhil'tsova},
     title = {A~lower bound for the coding cost and the asymptotically optimal coding of stochastic context-free languages},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {26--45},
     publisher = {mathdoc},
     volume = {8},
     number = {3},
     year = {2001},
     language = {ru},
     url = {https://geodesic-test.mathdoc.fr/item/DA_2001_8_3_a2/}
}
TY  - JOUR
AU  - L. P. Zhil'tsova
TI  - A~lower bound for the coding cost and the asymptotically optimal coding of stochastic context-free languages
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2001
SP  - 26
EP  - 45
VL  - 8
IS  - 3
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/DA_2001_8_3_a2/
LA  - ru
ID  - DA_2001_8_3_a2
ER  - 
%0 Journal Article
%A L. P. Zhil'tsova
%T A~lower bound for the coding cost and the asymptotically optimal coding of stochastic context-free languages
%J Diskretnyj analiz i issledovanie operacij
%D 2001
%P 26-45
%V 8
%N 3
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/DA_2001_8_3_a2/
%G ru
%F DA_2001_8_3_a2
L. P. Zhil'tsova. A~lower bound for the coding cost and the asymptotically optimal coding of stochastic context-free languages. Diskretnyj analiz i issledovanie operacij, Tome 8 (2001) no. 3, pp. 26-45. https://geodesic-test.mathdoc.fr/item/DA_2001_8_3_a2/