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, 1983, Volume 270, Number 6, Pages 1340–1342 (Mi dan10051)  
CYBERNETICS AND THE REGULATION THEORY

Complexity of probabilistic automata which recognize regular languages

I. A. Pokrovskaya
Full-text PDF (440 kB)
Presented: A. N. Tikhonov
Received: 09.11.1982
Bibliographic databases:
Document Type: Article
UDC: 519.95
Language: Russian
Citation: I. A. Pokrovskaya, “Complexity of probabilistic automata which recognize regular languages”, Dokl. Akad. Nauk SSSR, 270:6 (1983), 1340–1342
Citation in format AMSBIB
\Bibitem{Pok83}
\by I.~A.~Pokrovskaya
\paper Complexity of probabilistic automata which recognize regular
languages
\jour Dokl. Akad. Nauk SSSR
\yr 1983
\vol 270
\issue 6
\pages 1340--1342
\mathnet{http://mi.mathnet.ru/dan10051}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=0712946}
\zmath{https://zbmath.org/?q=an:0541.68031}
Linking options:
  • https://www.mathnet.ru/eng/dan10051
  • https://www.mathnet.ru/eng/dan/v270/i6/p1340
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:89
    Full-text PDF :39
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024