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, 1989, Volume 1, Issue 4, Pages 63–77 (Mi dm941)  
Stochasticity of languages that can be recognized by two-sided finite probabilistic automata

Ya. Ya. Kanep
Full-text PDF (1659 kB)
Abstract: We prove that with two-sided finite probabilistic automata only stochastic languages can be recognized, i.e., the capabilities of one-sided and two-sided finite probabilistic automata with a nonisolated point of intersection are identical with respect to recognition of languages. We give estimates for the increase in the number of states on passing from two-sided to one-sided automata that recognize the same language.
Received: 20.02.1989
Bibliographic databases:
UDC: 519.71
Language: Russian
Citation: Ya. Ya. Kanep, “Stochasticity of languages that can be recognized by two-sided finite probabilistic automata”, Diskr. Mat., 1:4 (1989), 63–77; Discrete Math. Appl., 1:4 (1991), 405–421
Citation in format AMSBIB
\Bibitem{Kan89}
\by Ya.~Ya.~Kanep
\paper Stochasticity of languages that can be recognized by two-sided finite probabilistic automata
\jour Diskr. Mat.
\yr 1989
\vol 1
\issue 4
\pages 63--77
\mathnet{http://mi.mathnet.ru/dm941}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1041685}
\zmath{https://zbmath.org/?q=an:0796.68157}
\transl
\jour Discrete Math. Appl.
\yr 1991
\vol 1
\issue 4
\pages 405--421
Linking options:
  • https://www.mathnet.ru/eng/dm941
  • https://www.mathnet.ru/eng/dm/v1/i4/p63
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:325
    Full-text PDF :141
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024