Decision Questions for Probabilistic Automata on Small Alphabets
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2021
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910327335026688 |
|---|---|
| author | Bell, Paul C. Semukhin, Pavel |
| author_facet | Bell, Paul C. Semukhin, Pavel |
| contents | We study the emptiness and $λ$-reachability problems for unary and binary Probabilistic Finite Automata (PFA) and characterise the complexity of these problems in terms of the degree of ambiguity of the automaton and the size of its alphabet. Our main result is that emptiness and $λ$-reachability are solvable in EXPTIME for polynomially ambiguous unary PFA and if, in addition, the transition matrix is binary, we show they are in NP. In contrast to the Skolem-hardness of the $λ$-reachability and emptiness problems for exponentially ambiguous unary PFA, we show that these problems are NP-hard even for finitely ambiguous unary PFA. For binary polynomially ambiguous PFA with fixed and commuting transition matrices, we prove NP-hardness of the $λ$-reachability (dimension 9), nonstrict emptiness (dimension 37) and strict emptiness (dimension 40) problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2105_10293 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Decision Questions for Probabilistic Automata on Small Alphabets Bell, Paul C. Semukhin, Pavel Formal Languages and Automata Theory Logic in Computer Science We study the emptiness and $λ$-reachability problems for unary and binary Probabilistic Finite Automata (PFA) and characterise the complexity of these problems in terms of the degree of ambiguity of the automaton and the size of its alphabet. Our main result is that emptiness and $λ$-reachability are solvable in EXPTIME for polynomially ambiguous unary PFA and if, in addition, the transition matrix is binary, we show they are in NP. In contrast to the Skolem-hardness of the $λ$-reachability and emptiness problems for exponentially ambiguous unary PFA, we show that these problems are NP-hard even for finitely ambiguous unary PFA. For binary polynomially ambiguous PFA with fixed and commuting transition matrices, we prove NP-hardness of the $λ$-reachability (dimension 9), nonstrict emptiness (dimension 37) and strict emptiness (dimension 40) problems. |
| title | Decision Questions for Probabilistic Automata on Small Alphabets |
| topic | Formal Languages and Automata Theory Logic in Computer Science |
| url | https://arxiv.org/abs/2105.10293 |