Probabilistic automata of bounded ambiguity
Probabilistic automata are a computational model introduced by Michael Rabin, extending nondeterministic finite automata with probabilistic transitions. Despite its simplicity, this model is very expressive and many of the associated algorithmic questions are undecidable. In this work we focus on th...
| Päätekijät: | , , |
|---|---|
| Aineistotyyppi: | Conference item |
| Julkaistu: |
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
2017
|