Patterns in trees used in the derivation of words in a stochastic context-free language and a lower bound on coding cost. A critical case
Diskretnyj analiz i issledovanie operacij, Tome 10 (2003) no. 3, pp. 23-53.

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

@article{DA_2003_10_3_a2,
     author = {L. P. Zhil'tsova},
     title = {Patterns in trees used in the derivation of words in a stochastic context-free language and a lower bound on coding cost. {A} critical case},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {23--53},
     publisher = {mathdoc},
     volume = {10},
     number = {3},
     year = {2003},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2003_10_3_a2/}
}
TY  - JOUR
AU  - L. P. Zhil'tsova
TI  - Patterns in trees used in the derivation of words in a stochastic context-free language and a lower bound on coding cost. A critical case
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2003
SP  - 23
EP  - 53
VL  - 10
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2003_10_3_a2/
LA  - ru
ID  - DA_2003_10_3_a2
ER  - 
%0 Journal Article
%A L. P. Zhil'tsova
%T Patterns in trees used in the derivation of words in a stochastic context-free language and a lower bound on coding cost. A critical case
%J Diskretnyj analiz i issledovanie operacij
%D 2003
%P 23-53
%V 10
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2003_10_3_a2/
%G ru
%F DA_2003_10_3_a2
L. P. Zhil'tsova. Patterns in trees used in the derivation of words in a stochastic context-free language and a lower bound on coding cost. A critical case. Diskretnyj analiz i issledovanie operacij, Tome 10 (2003) no. 3, pp. 23-53. http://geodesic.mathdoc.fr/item/DA_2003_10_3_a2/

[1] Akho A., Ulman Dzh., Teoriya sintaksicheskogo analiza, perevoda i kompilyatsii, Tom 1, Mir, M., 1978

[2] Gantmakher F. R., Teoriya matrits, Nauka, M., 1967 | MR

[3] Zhiltsova L. P., “Zakonomernosti primeneniya pravil grammatiki v vyvodakh slov stokhasticheskogo kontekstno-svobodnogo yazyka”, Matematicheskie voprosy kibernetiki, no. 9, Nauka, M., 2000, 101–126 | MR

[4] Zhiltsova L. P., “O nizhnei otsenke stoimosti kodirovaniya i asimptoticheski optimalnom kodirovanii stokhasticheskogo kontekstno-svobodnogo yazyka”, Diskret. analiz i issled. operatsii. Ser. 1, 8:3 (2001), 26–45 | MR

[5] Krichevskii R. E., Szhatie i poisk informatsii, Radio i svyaz, M., 1989 | MR

[6] Sevastyanov V. A., Vetvyaschiesya protsessy, Nauka, M., 1971

[7] Shennon K., Matematicheskaya teoriya svyazi, IL, M., 1963

[8] Shiryaev A. N., Veroyatnost, Nauka, M., 1980 | MR | Zbl