Name
Abstract | ||
|---|---|---|
We show the identity between sets of fair computations in recursive transition graphs, sets of cluster points of finite computations for Π 0 1 ultra-metrics refining the Baire metrics, and Π 0 3 subsets of ω ω . The results are applied to recursive marked trees, fairness definitions, ω-regular languages, and Π 0 3 sets. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1016/0304-3975(92)90390-2 | Theor. Comput. Sci. |
DocType | Volume | Issue |
Journal | 97 | 1 |
ISSN | Citations | PageRank |
Theoretical Computer Science | 9 | 0.91 |
References | Authors | |
4 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Philippe Darondeau | 1 | 715 | 77.04 |
| Doris Nolte | 2 | 11 | 2.50 |
| Lutz Priese | 3 | 240 | 31.41 |
| Serge Yoccoz | 4 | 20 | 2.95 |