Pushing undecidability of the isolation problem for probabilistic automata - Université Paris Cité Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2011

Pushing undecidability of the isolation problem for probabilistic automata

Résumé

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 for general probabilistic automata, without restriction on the number of probabilistic transitions. In this note, we develop a simulation technique that allows to simulate any probabilistic automaton with one having only one probabilistic transition.
Fichier principal
Vignette du fichier
one_transition_automata.pdf (111.53 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00585840 , version 1 (14-04-2011)

Identifiants

Citer

Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj. Pushing undecidability of the isolation problem for probabilistic automata. 2011. ⟨hal-00585840⟩
106 Consultations
38 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More