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




Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 2005, Volume 12, Issue 2, Pages 78–99 (Mi da67)  
This article is cited in 15 scientific papers (total in 15 papers)

Combinatorial complexity of rational languages

A. M. Shur

Ural State University
Full-text PDF (338 kB) Citations (15)
References:
PDF
HTML
Received: 18.08.2004
Revised: 27.12.2004
Bibliographic databases:
UDC: 519.718
Language: Russian
Citation: A. M. Shur, “Combinatorial complexity of rational languages”, Diskretn. Anal. Issled. Oper., Ser. 1, 12:2 (2005), 78–99
Citation in format AMSBIB
\Bibitem{Shu05}
\by A.~M.~Shur
\paper Combinatorial complexity of rational languages
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 2005
\vol 12
\issue 2
\pages 78--99
\mathnet{http://mi.mathnet.ru/da67}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=2168157}
\zmath{https://zbmath.org/?q=an:1249.68107}
\elib{https://elibrary.ru/item.asp?id=9529848}
Linking options:
  • https://www.mathnet.ru/eng/da67
  • https://www.mathnet.ru/eng/da/v12/s1/i2/p78
    • This publication is cited in the following 15 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:762
    Full-text PDF :242
    References:103
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025