Name
Abstract | ||
|---|---|---|
Zero automata are a probabilistic extension of parity automata on infinite trees. The satisfiability of a certain probabilistic variant of MSO, called TMSO+zero, reduces to the emptiness problem for zero automata. We introduce a variant of zero automata called nonzero automata. We prove that for every zero automaton there is an equivalent nonzero automaton of quadratic sizeand the emptiness problem of nonzero automata is decidable, with complexity co-NP. These results imply that TMSO+zero has decidable satisfiability. |
Year | Venue | DocType |
|---|---|---|
2017 | ICALP | Conference |
Volume | Citations | PageRank |
abs/1702.06858 | 2 | 0.40 |
References | Authors | |
2 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mikolaj Bojanczyk | 1 | 352 | 35.99 |
| Gimbert, H. | 2 | 5 | 3.21 |
| Edon Kelmendi | 3 | 20 | 5.34 |