When are emptiness and containment decidable for probabilistic automata?
The emptiness and containment problems for probabilistic automata are natural quantitative generalisations of the classical language emptiness and inclusion problems for Boolean automata. It is known that both problems are undecidable. We provide a more refined view of these problems in terms of the...
| Hlavní autoři: | , , , , |
|---|---|
| Médium: | Journal article |
| Jazyk: | English |
| Vydáno: |
Elsevier
2021
|