Probabilistic Automata on Finite words: Decidable and Undecidable Problems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Probabilistic Automata on Finite words: Decidable and Undecidable Problems

Résumé

This paper tackles three algorithmic problems for probabilis- tic automata on finite words: the Emptiness Problem, the Isolation Prob- lem and the Value 1 Problem. The Emptiness Problem asks, given some probability 0 ≤ λ ≤ 1, whether there exists a word accepted with prob- ability greater than λ, and the Isolation Problem asks whether there exist words whose acceptance probability is arbitrarily close to λ. Both these problems are known to be undecidable [8, 2, 3]. About the Empti- ness problem, we provide a new simple undecidability proof and prove that it is decidable for automata with one probabilistic transition and undecidable for automata with as few as two probabilistic transitions. The Value 1 Problem is the special case of the Isolation Problem when λ = 1 or λ = 0. The decidability of the Value 1 Problem was an open question. We show that the Value 1 Problem is undecidable. Moreover, we introduce a new class of probabilistic automata, ♯-acyclic automata, for which the Value 1 Problem is decidable.
Fichier principal
Vignette du fichier
gimbert_oualhadj_probabilistic_automata.pdf (216.68 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00456538 , version 1 (15-02-2010)
hal-00456538 , version 2 (17-02-2010)
hal-00456538 , version 3 (27-04-2010)

Identifiants

Citer

Hugo Gimbert, Youssouf Oualhadj. Probabilistic Automata on Finite words: Decidable and Undecidable Problems. ICALP 2010, Jul 2010, Bordeaux, France. pp.527-538, ⟨10.1007/978-3-642-14162-1_44⟩. ⟨hal-00456538v3⟩

Collections

CNRS
523 Consultations
1655 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More