|
Intelligent systems. Theory and applications, 2016, Volume 20, Issue 2, Pages 283–330
(Mi ista133)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Main concepts of a theory of probabilistic automata (part 2)
A. M. Mironov Institute of Informatics Problems of the Russian Academy of Sciences
Abstract:
The basic concepts of a theory of probabilistic Moore automata with numerical output and probabilistic languages are presented. We deliver new proofs of classical theorems related to equivalence and reduction of probabilistic Moore automata, as well as theorems related to regularity of probabilistic languages.
Keywords:
probabilistic automata, probabilistic languages.
Citation:
A. M. Mironov, “Main concepts of a theory of probabilistic automata (part 2)”, Intelligent systems. Theory and applications, 20:2 (2016), 283–330
Linking options:
https://www.mathnet.ru/eng/ista133 https://www.mathnet.ru/eng/ista/v20/i2/p283
|
Statistics & downloads: |
Abstract page: | 122 | Full-text PDF : | 62 |
|