Abstract: | Abstract The behavior of a probabilistic automaton is essentially characterized by products of matrices selected from a given finite set of stochastic matrices. It is of interest to know under what conditions these matrix products are stable against perturbations of the entries in the matrices. |