Decidability of cutpoint isolation for probabilistic finite automata on letter-bounded inputs

Paul C. Bell, Pavel Semukhin

We show the surprising result that the cutpoint isolation problem is decidable for Probabilistic Finite Automata (PFA) where input words are taken from a letter-bounded context-fre…