18 citations · 34 across the 12 of their papers we have counts for
4 papers · 1 filter
Two Recursively Inseparable Problems for Probabilistic Automata
Nathanaël Fijalkow, Hugo Gimbert, Florian Horn +1
This paper introduces and investigates decision problems for numberless probabilistic automata, i.e. probabilistic automata where the support of each probabilistic transitions is s…
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…
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…
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…