On two-state isolated probabilistic automata

In this paper we generalize and extend Yasui and Yajima's results on two-state two-symbol probabilistic automata to the two-state multisymbol case. We use a slightly different notion of isolated probabilistic automata independent of the initial distribution. An algorithm is derived to synthesize such automata. Finally we show the existence of a regular language accepted by some completely isolated probabilistic automaton