Deciding the value 1 problem for probabilistic leaktight automata

Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi +1

The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton, are there words accepted with probability arbitrarily close…