Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 2003, Volume 10, Issue 3, Pages 23–53 (Mi da136)  

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

L. P. Zhil'tsova

Nizhny Novgorod State Pedagogical University
References:
Received: 29.04.2003
Bibliographic databases:
UDC: 519.713
Language: Russian
Citation: 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”, Diskretn. Anal. Issled. Oper., Ser. 1, 10:3 (2003), 23–53
Citation in format AMSBIB
\Bibitem{Zhi03}
\by L.~P.~Zhil'tsova
\paper 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
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 2003
\vol 10
\issue 3
\pages 23--53
\mathnet{http://mi.mathnet.ru/da136}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2020831}
\zmath{https://zbmath.org/?q=an:1073.68052}
Linking options:
  • https://www.mathnet.ru/eng/da136
  • https://www.mathnet.ru/eng/da/v10/s1/i3/p23
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:403
    Full-text PDF :108
    References:77
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024