The Wagner hierarchy

International Journal of Algebra and Computation

Volumn 9, Issue 5, 1999, Pages 597-620

  Carton, Olivier ^a   Perrin, Dominique ^a  

^a Université de Marne la Vallée   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000754339     PISSN: 02181967     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218196799000357     Document Type: Article

References (21)

1. R. Barua, The Hausdorff-Kuratowski hierarchy of ω-regular languages and a hierarchy of Muller automata, Theoret. Comput. Sci. 96 (1992), 345-360.
2. O. Carton and D. Perrin, Chains and superchains in ω-semigroups in Semigroups, Automata and Languages, eds. J. Almeida, G. Gomes and P. Suva, World Scientific, 1994, pp. 17-28.
3. O. Carton and D. Perrin, Chains and superchains for ω-rational sets, automata and semigroups, Int. J. Algebra Comput. to appear (1997).
4. O. Carton and D. Perrin, The Wadge- Wagner hierarchy of ω-rational sets in Automata, Languages and Programming, eds. P. Degano, R. Gorrieri and A. Marchetti-Spaccamela, Lecture Notes in Compututer Science, 1256 Springer, 1997, pp. 17-35.
5. Y. Gurevich and L. Harrington, Trees, automata and games in Proc. ACM Symp. on Theory of Computing, Assoc. Comput. Mach. (1982), pp. 60-65.
6. F. Hausdorff, Set Theory, Chelsea, New York, 1957.
7. M. Kaminski, A classification of ω-regular languages Theor. Comput. Sci. 36 (1985), 217-229.
8. A. S. Kechris, Classical Descriptive Set Theory, Graduate Texts in Mathematics 156 Springer, 1995.
9. L. H. Landweber, Decision problems for ω-automata, Math. Systems Theory 3 (1969), 376-384.
10. A. Louveau, Some results in the Wadge hierarchy of Borel sets, in Cabal Seminar 79-81, Lecture Notes in Mathematics, ed. A. S. Kechris et al. 1019, Springer 1981, pp. 28-55.
11. Z. Manna and A. Pnueli, A hierarchy of temporal properties, in Principles of Distributed Computing (1990), pp. 377-408.
12. J.-P. Ressayre, Les hiérarchie en théorie des automates et en théorie des ensembles, Notes, 1994.
13. J. G. Rosenstein, Linear Orderings, Academic Press, 1982.
14. V. Selivanov, Fine hierarchy of regular ω-languages, in TAPSOFT '95: Theory and Practice of Software Development, Lecture Notes in Computer Science, eds. P. D. Mosses, M. Nielsen, and M. I. Schwarzbach 915, Springer, 1995 pp. 277-287.
15. P. Simonnet, Automates et Théorie Descriptive, Thèse, Université Paris 7, 1992.
16. L. Staiger, ω -languages, in Handbook of Formal Languages, eds. G. Rosenberg and A. Salomaa, Springer, 3, 1997, pp. 339-387.
17. L. Staiger and K. Wagner, Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regulärer Folgenmengen Elektron. Informationsverarb. Kybernet. 10 (1974), 379-392.
18. W. Thomas, Automata on infinite objects, in Handbook of Theoretical Computer Science, Vol. B, Chap. 4, ed. J. van Leeuwen, Eisevier, 1990.
19. W. Thomas, Languages, automata and logic, in Handbook of Formal Languages, eds. G. Rosenberg and A. Salomaa, 3, Springer, 1997, pp. 389-449.
20. K. Wagner, Eine topologische Charakteriesierung einiger Klassen regulärer Folgenmengen, Elektron. Informationsverarb. Kybernet. 13(9) (1977) 505-519.
21. K. Wagner, On ω-regular sets, Inform. Control 43 (1979) 123-177.