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, 1991, Volume 3, Issue 2, Pages 114–120 (Mi dm794)  
Comparative complexity of probabilistic and deterministic automata

F. M. Ablayev
Full-text PDF (706 kB)
Abstract: An estimate of complexity is obtained for the probabilistic automaton representing a language with an isolated section point. This estimate depends on the degree of isolation of the section point and on the automata structure of the language. Examples of languages are presented, which illustrate the relation between this estimate and the estimate obtained earlier by M.  O. Rabin [Kibern. Sb. Nov. Ser. 9, 123–141 (1964)].
Received: 21.02.1989
Bibliographic databases:
UDC: 519
Language: Russian
Citation: F. M. Ablayev, “Comparative complexity of probabilistic and deterministic automata”, Diskr. Mat., 3:2 (1991), 114–120
Citation in format AMSBIB
\Bibitem{Abl91}
\by F.~M.~Ablayev
\paper Comparative complexity of probabilistic and deterministic automata
\jour Diskr. Mat.
\yr 1991
\vol 3
\issue 2
\pages 114--120
\mathnet{http://mi.mathnet.ru/dm794}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1134287}
\zmath{https://zbmath.org/?q=an:0805.68087}
Linking options:
  • https://www.mathnet.ru/eng/dm794
  • https://www.mathnet.ru/eng/dm/v3/i2/p114
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:346
    Full-text PDF :139
    First page:3
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024