van Heerdt, G;
Hsu, J;
Ouaknine, J;
Silva, A;
(2025)
Convex language semantics for nondeterministic probabilistic automata.
Theoretical Computer Science
, 1040
, Article 115191. 10.1016/j.tcs.2025.115191.
![[thumbnail of main.pdf]](https://discovery.ucl.ac.uk/style/images/fileicons/text.png) |
Text
main.pdf - Accepted Version Access restricted to UCL open access staff until 23 June 2026. Download (504kB) |
Abstract
We explore language semantics for automata combining probabilistic and nondeterministic behaviors. We first show that there are precisely two natural semantics for probabilistic automata with nondeterminism. For both choices, we show that these automata are strictly more expressive than deterministic probabilistic automata, and we prove that the problem of checking language equivalence is undecidable by reduction from the threshold problem. However, we provide a discounted metric that can be computed to arbitrarily high precision.
| Type: | Article |
|---|---|
| Title: | Convex language semantics for nondeterministic probabilistic automata |
| DOI: | 10.1016/j.tcs.2025.115191 |
| Publisher version: | https://doi.org/10.1016/j.tcs.2025.115191 |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10208673 |
Archive Staff Only
 |
View Item |
