18 citations · 34 across the 12 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.FL2011★ 2 cited
Pushing undecidability of the isolation problem for probabilistic automata
Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj
This short note aims at proving that the isolation problem is undecidable for probabilistic automata with only one probabilistic transition. This problem is known to be undecidable…
cs.FL2011★ 3 cited
Deciding the Value 1 Problem of Probabilistic Leaktight Automata
Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj
The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton A, are there words accepted by A with probability arbitraril…