×

zbMATH — the first resource for mathematics

On stable generation of random sequences by probabilistic automata. (Russian) Zbl 0671.68022
The stability of the behaviour of probabilistic automata is considered. The main problem is whether the random sequences, generated by a probabilistic automaton, are stable with respect to relatively small variations of the probabilities, associated to the operation of the automaton. The stability problem is investigated for four cases of stability behaviour of automata.
Reviewer: K.Peeva
MSC:
68Q45 Formal languages and automata
PDF BibTeX XML Cite