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, 1997, Volume 4, Issue 1, Pages 53–59 (Mi da387)  
This article is cited in 5 scientific papers (total in 5 papers)

On the combinatorial complexity of iteratively generated symbol sequences

A. È. Frid

Novosibirsk State University
Full-text PDF (598 kB) Citations (5)
Received: 28.11.1996
Bibliographic databases:
UDC: 519.114
Language: Russian
Citation: A. È. Frid, “On the combinatorial complexity of iteratively generated symbol sequences”, Diskretn. Anal. Issled. Oper., Ser. 1, 4:1 (1997), 53–59
Citation in format AMSBIB
\Bibitem{Fri97}
\by A.~\`E.~Frid
\paper On the combinatorial complexity of iteratively generated symbol sequences
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 1997
\vol 4
\issue 1
\pages 53--59
\mathnet{http://mi.mathnet.ru/da387}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1490442}
\zmath{https://zbmath.org/?q=an:0868.11013}
Linking options:
  • https://www.mathnet.ru/eng/da387
  • https://www.mathnet.ru/eng/da/v4/s1/i1/p53
    • This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:213
    Full-text PDF :100
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024