Publications in Math-Net.Ru
-
On a Matrix of First Moments for Decomposable Stochastic CF-Grammar
Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 151:2 (2009), 80–89
-
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
Diskretn. Anal. Issled. Oper., Ser. 1, 10:3 (2003), 23–53
-
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
-
Coding of stochastic context-free languages with unique derivation
Diskr. Mat., 6:3 (1994), 73–88
-
Algorithmic complexity of problems of optimal alphabetical coding for context-free languages
Diskr. Mat., 1:2 (1989), 38–51
© , 2024