This article is cited 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.