Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnaya Matematika, 2000, Volume 12, Issue 1, Pages 145–157
DOI: https://doi.org/10.4213/dm319 (Mi dm319) 		 
This article is cited in 1 scientific paper (total in 1 paper)

On the complexity of the realization of finite languages by formulas

E. V. Orlova
Full-text PDF (1245 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm319
Abstract: We consider realizations of finite languages of regular expressions over finite alphabets by formulas with minimal complexity. Some classes of languages are investigated and for their complexities the best bounds up to the order are obtained. The main attention is given to realizations of languages consisting of words of equal length.
Received: 17.01.2000
Bibliographic databases:
UDC: 519.6
Language: Russian
Citation: E. V. Orlova, “On the complexity of the realization of finite languages by formulas”, Diskr. Mat., 12:1 (2000), 145–157; Discrete Math. Appl., 10:2 (2000), 159–173
Citation in format AMSBIB
\Bibitem{Orl00}
\by E.~V.~Orlova
\paper On the complexity of the realization of finite languages by formulas
\jour Diskr. Mat.
\yr 2000
\vol 12
\issue 1
\pages 145--157
\mathnet{http://mi.mathnet.ru/dm319}
\crossref{https://doi.org/10.4213/dm319}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1778773}
\zmath{https://zbmath.org/?q=an:0966.68101}
\transl
\jour Discrete Math. Appl.
\yr 2000
\vol 10
\issue 2
\pages 159--173
Linking options:
  • https://www.mathnet.ru/eng/dm319
  • https://doi.org/10.4213/dm319
  • https://www.mathnet.ru/eng/dm/v12/i1/p145
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:319
    Full-text PDF :174
    References:30
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024