Name
Abstract | ||
|---|---|---|
We introduce a general method for proving measurability of topologically complex sets by establishing a correspondence between the notion of game tree languages from automata theory and the sigma-algebra of R-sets, introduced by A. Kolmogorov as a foundation for measure theory. We apply the method to answer positively to an open problem regarding the game interpretation of the probabilistic mu-calculus. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-662-44522-8_26 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Parity game,Automata theory,Open problem,Computer science,Implementation theory,Probabilistic logic,Polish space,Game tree,Game complexity | Conference | 8634 |
ISSN | Citations | PageRank |
0302-9743 | 11 | 0.63 |
References | Authors | |
8 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomasz Gogacz | 1 | 43 | 5.80 |
| Henryk Michalewski | 2 | 11 | 0.63 |
| Matteo Mio | 3 | 23 | 3.85 |
| Michal Skrzypczak | 4 | 11 | 0.63 |