Fine hierarchy of regular ω-languages

Theoretical Computer Science

Volumn 191, Issue 1-2, 1998, Pages 37-59

  Selivanov, Victor ^a  

^a NOVOSIBIRSK STATE PEDAGOGICAL UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003018677     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00301-0     Document Type: Article

References (26)

1. R. Barua, The Hausdorff-Kuratowski hierarchy of ω-regular languages and a hierarchy of Muller automata, Theoret. Comput. Sci. 96 (1992) 345-360.
2. J.R. Büchi, L.H. Landweber, Solving sequential conditions by finite-state strategies, Trans. Amer. Math. Soc. 138 (1969) 295-311.
3. S. Krishnan, A. Puri, R. Brayton, Structural complexity of ω-automata. In: Proceedings of the conference TAPSOFT'95 in Aarhus, Denmark, Lecture Notes in Computer Science, vol. 915, Springer, Berlin, 1995, pp. 143-156.
4. K. Kuratowski, A. Mostowski, Set Theory, North-Holland, Amsterdam, 1967.
5. A. Louveau, Some results in the Wadge hierarchy of Borel sets, in: Cabal Seminar 79-81, Proc., Lecture Notes in Math., vol. 1019, Springer, Berlin, 1983, pp. 28-55.
6. A. Louveau, J. Saint Raimond, Borel classes and closed games: Wadge-type and Hurewics-type results, Trans. Amer. Math. Soc. 304 (1987) 431-467.
7. Y.N. Moschovakis, Descriptive set theory, North-Holland, Amsterdam, 1980.
8. V.L. Selivanov, Hierarchies of hyperarithmetical sets and functions, Algebra i Logika 22 (1983) 666-692 (in Russian). English translation: Algebra and Logic 22 (1983) 473-491.
9. V.L. Selivanov, Hierarchies of hyperarithmetical sets and functions, Algebra i Logika 22 (1983) 666-692 (in Russian). English translation: Algebra and Logic 22 (1983) 473-491.
10. V.L. Selivanov, Fine hierarchies of arithmetical sets and definable index sets, Trudy Mat. Inst. Novosibirsk 12 (1989) 165-185 (in Russian).
11. V.L. Selivanov, Fine hierarchies and definable index sets, Algebra i Logika 30 (1991) 705-725 (in Russian). English translation: Algebra and Logic 30 (1991) 463-475.
12. V.L. Selivanov, Fine hierarchies and definable index sets, Algebra i Logika 30 (1991) 705-725 (in Russian). English translation: Algebra and Logic 30 (1991) 463-475.
13. V.L. Selivanov, Fine hierarchy of formulas, Algebra i Logika 30 (5) (1991) 568-582 (in Russian). English translation: Algebra and Logic 30 (1991) 368-379.
14. V.L. Selivanov, Fine hierarchy of formulas, Algebra i Logika 30 (5) (1991) 568-582 (in Russian). English translation: Algebra and Logic 30 (1991) 368-379.
15. V.L. Selivanov, Two refinements of the polynomial hierarchy, in: Proc. Symp. on Theoretical Aspects of Computer Science STACS-94, Lecture Notes in Comuputer Science, vol. 775, Springer, Berlin, 1994, pp. 439-448 (a complete version is available as Preprint No 9, University of Heidelberg, Chair of Math. Logic).
16. V.L. Selivanov, Fine hierarchy of regular ω-languages, in: Proc. conf. TAPSOFT'95, Aarhus, Denmark, Lecture Notes in Computer Science, vol. 915, Springer, Berlin, 1995, pp. 277-287.
17. V.L. Selivanov, Fine hierarchies and Boolean terms, J. Symbol. Logic 60 (1995) 289-317.
18. L. Staiger, Research in the theory of ω-languages, J. Inform. Process. Cybernet. 23 (1987) 415-439.
19. L. Staiger, K. Wagner, Automatentheoretische und automatenfreie Characterisierungen topologischer klassen regulärer Folgenmengen., Elektron. Inf. verarb. Kybern. EIK 10 (7) (1974) 379-392.
20. J. Steel, Determinateness and the separation property, J. Symbol. Logic 45 (1980) 143-146.
21. W. Thomas, Automata on infinite objects, Handbook of Theoretical Computer Science, vol. B (1990) 133-191.
22. Van Wesep, Wadge degrees and descriptive set theory, in: Cabal Seminar 76-77, Proceedings, Lecture Notes in Math., vol. 689, Springer, Berlin, 1976, pp. 151-170.
23. W. Wadge, Reducibility and determinateness in the Baire space, Ph.D. thesis, University of California, Berkely, 1983.
24. K. Wagner, Eine topologische Characterisierung einiger Klassen regulärer Folgenmengen, Elektron. Inf. verarb. Kybern. EIK 13 (9) (1977) 473-487.
25. K. Wagner, On ω-regular sets, Inform, and Control 43 (1979) 123-177.
26. T. Wilke, H. Yoo, Computing the Wadge degree, the Lipschitz degree, and the Rabin index of a regular language of infinite words in polynomial time, in: Proc. conf. TAPSOFT'95, Aarhus, Denmark, Lecture Notes in Computer Science, vol. 915, Springer, Berlin, 1995, pp. 288-302.