The wadge-wagner hierarchy of ω-rational sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1256, Issue , 1997, Pages 17-35

  Carton, Olivier ^a   Perrin, Dominique ^a  

^a Ecole Superieure d'Informatique et Genie des Telecommunications   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

DESCRIPTIVE SET THEORY; RATIONAL SETS; SEMI-GROUP;

SET THEORY;

EID: 67650376298     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_162     Document Type: Conference Paper

References (25)

1. Jorge Almeida. Finite Semigroups and Universal Algebra. World Scientific, 1994.
2. Rana Barua. The Hausdorff-Kuratowski hierarchy of w-regular languages and a hierarchy of Muller automata. Theoretical Computer Science, 96:345-360, 1992.
3. Nicolas Bedon. Automata, semigroups and recognizability of words on ordinals. IGM report 96-5, to appear in International Journal of Algebra and Computation.
4. Olivier Carton. Mots infinis, ui-semigroupes et Topologie. These, Université Paris 7, 1993. Report LITP-TH 93-08.
5. Olivier Carton and Dominique Perrin. The Wagner hierarchy of w-rational sets. To appear in International journal of algebra and computation.
6. Olivier Carton and Dominique Perrin. Chains and superchains in w-semigroups. In Jorge Almeida, Grancinda Gomes, and Pedro Silva, editors, Semigroups, Automata and Languages, pages 17-28. World Scientific, 1994.
7. Olivier Carton and Dominique Perrin. Chains and superchains for w-rational sets, automata and semigroups. International journal of algebra and computation, 1997. to appear.
8. John M. Howie. Fundamentals of Semigroup Theory. Oxford University Press, 1995.
9. Micheal Kamiński. A classification of ^-regular languages. Theoretical Computer Science, 36:217-229, 1985.
10. Alexander S. Kechris. Classical Descriptive Set Theory, volume 156 of Graduate texts in mathematics. 1995.
11. Sriram C. Krishnan, Anuj Puri, and Robert K. Brayton. Structural complexity of iii-languages. In STACS '95, volume 900 of Lecture Notes in Computer Science, pages 143-156, Berlin, 1995. Springer-Verlag.
12. Lawrence H. Landweber. Decision problems for ai-automata. Mathematical Systems Theory, 3:376-384, 1969.
13. Douglas Lind and Brian Marcus. An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, 1995.
14. Alain Louveau. Some results in the Wadge hierarchy of Borel sets. In A.S. Kechris et al., editor, Cabal Seminar 79-81, volume 1019 of Lecture Notes in Math., pages 28-55. Springer-Verlag, 1981.
15. Zohar Manna and Amir Pnueli. A hierarchy of temporal properties. In Principles of Distributed Computing, pages 377-408, 1990.
16. Dominique Perrin and Jean-Eric Pin. Infinite words. Version 1.4, Report LITP 97.04 (http://litp.ibp.fr/~jep/Resumes/MotsInfinis.html).
17. Dominique Perrin and Jean-Eric Pin. Semigroups and automata on infinite words. In J. Fountain and V. A. R. Gould, editors, NATO Advanced Study Institute Semigroups, Formal Languages and Groups, pages 49-72. Kluwer academic publishers, 1995.
18. Jean-Eric Pin. A variety theorem without complementation. Russian Mathematics (Iz. VUZ), 39:80-90, 1995.
19. Pierre Simonnet. Automates et Théorie Descriptive. These, Université Paris 7, 1992.
20. Ludwig Staiger and Klaus Wagner Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regularer Folgenmengen. Elektron. In-formationsverarb, Kybernet., 10:379-392, 1974.
21. Wolfgang Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 4. Elsevier, 1990.
22. Klaus Wagner. On w-regular sets. Information and Control, 43:123-177, 1979.
23. Thomas Wilke. An Eilenberg theorem for oo-languages. In ICALP '91, volume 510 of Lecture Notes in Computer Science, pages 588-599, Berlin, 1991. Springer-Verlag.
24. Thomas Wilke. An algebraic theory for regular languages of finite and infinite words. Int. J. Alg. CompuL, 3(4):447-489, 1993.
25. Thomas Wilke and Haiseung Yoo. Computing the Rabin index of a regular language of infinite words. To appear in International Journal of Algebra and Computation, 1997.