Doklady Akademii Nauk SSSR
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Dokl. Akad. Nauk:
Year:
Volume:
Issue:
Page:
Find




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

Doklady Akademii Nauk SSSR, 1976, Volume 228, Number 2, Pages 287–289 (Mi dan40084)  
MATHEMATICS

The complexity of enumerating a finite set of words

R. E. Krichevskii

Institute of Mathematics, Siberian Branch of USSR Academy of Sciences, Novosibirsk
Full-text PDF (446 kB)
Presented: S. L. Sobolev
Received: 15.01.1976
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: R. E. Krichevskii, “The complexity of enumerating a finite set of words”, Dokl. Akad. Nauk SSSR, 228:2 (1976), 287–289
Citation in format AMSBIB
\Bibitem{Kri76}
\by R.~E.~Krichevskii
\paper The complexity of enumerating a finite set of words
\jour Dokl. Akad. Nauk SSSR
\yr 1976
\vol 228
\issue 2
\pages 287--289
\mathnet{http://mi.mathnet.ru/dan40084}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=0409006}
\zmath{https://zbmath.org/?q=an:0353.68061}
Linking options:
  • https://www.mathnet.ru/eng/dan40084
  • https://www.mathnet.ru/eng/dan/v228/i2/p287
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:172
    Full-text PDF :64
    References:4
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026