Sciweavers

ICALP
2010
Springer
14 years 4 months ago
Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
Abstract. This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Empti...
Hugo Gimbert, Youssouf Oualhadj