When is containment decidable for probabilistic automata?
The containment problem for quantitative automata is the natural quantitative generalisation of the classical language inclusion problem for Boolean automata. We study it for probabilistic automata, where it is known to be undecidable in general. We restrict our study to the class of probabilistic a...
| Autors principals: | , , , , , |
|---|---|
| Format: | Conference item |
| Publicat: |
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
2018
|