Chains and superchains for ω-rational sets, automata and semigroups

International Journal of Algebra and Computation

Volumn 7, Issue 6, 1997, Pages 673-695

  Carton, Olivier ^a   Perrin, Dominique ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0642367509     PISSN: 02181967     EISSN: None     Source Type: Journal    
DOI: 10.1142/s0218196797000290     Document Type: Article

References (20)

1. R. Barua, The Hausdorff-Kuratowski hierarchy of ω-regular languages and a hierarchy of Muller automata, Theor. Comput. Sci. 96, (1992), 345-360.
2. O. Carton, Mots infinis, ω-semigroupes et Topologie, Thèse, Université Paris 7, 1993, Report LITP-TH 93-08.
3. O. Carton, Chain automata, Theor. Comput. Sci. 161 (1996), 191-203.
4. O. Carton and R. Maceiras, Computing the Rabin index of a parity automaton, unpublished.
5. O. Carton and D. Perrin, The Wagner hierarchy of ω-rational sets, to appear in Int. J. Algebra and Computation.
6. O. Carton and D. Perrin, Chains and superchains in ω-semigroups, in J. Almeida, G. Gomes, and P. Silva, eds., Semigroups, Automata and Languages, pp. 17-28, World Scientific, 1994.
7. S. Eilenberg, Automata, Languages and Machines, Vol. A, Academic Press, New York, 1972.
8. F. Hausdorff, Set Theory, Chelsea, New York, 1957.
9. J. M. Howie, Fundamentals of Semigroup Thoery, Oxford University Press, 1995.
10. M. Kaminski, A classification of ω-regular languages, Theor. Comput. Sci. 36 (1985), 217-229.
11. S. C. Krishnan, A. Puri and R. K. Brayton, Structural Complexity of ω-languages, in STACS'95, Vol. 900 of Lecture Notes in Computer Science, pp. 143-156, Springer-Verlag, Berlin, 1995.
12. L. H. Landweber, Decision problems for ω-automata, Math. Syst. Theory, 3 (1969), 376-384.
13. A. Louveau, Some results in the Wadge hierarchy of Borel sets, in A. S. Kechris et al., ed., Cabal Seminar 79-81, Vol. 1019 of Lecture Notes in Math., pp. 28-55, Springer-Verlag, 1981.
14. D. Perrin and J. E. Pin, Semigroups and automata on infinite words, in NATO Advanced Study Institute Semigroups, Formal Languages and Groups, eds. J. Fountain and V. A. R. Gould, Kluwer Academic Publishers, 1995, pp. 49-72.
15. P. Simonnet, Automates et Théorie Descriptive, Thèse, Université Paris 7, 1992.
16. W. Thomas, Automata on infinite objects, in J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B, Chapter 4, Elsevier, 1990.
17. K. Wagner, One ω-regular sets, Information and Control, 43 (1979), 123-177.
18. T. Wilke, An Eilenberg theorem for ∞-languages, in ICALP'91, Vol. 510 of Lecture Notes in Computer Science, pp. 588-599, Springer-Verlag, Berlin, 1991.
19. T. Wilke, An algebraic theory for regular languages of finite and infinite words, Int. J. Alg. Comput. 3(4) (1993), 447-189.
20. T. Wilke and H. Yoo, Computing the Wadge degree, the Lifshitz degree, and the Rabin index of a regular language of infinite words in polynomial time, in P. D. Moses et al., ed., Trees in Algebra and Programming - CAAP'95, Vol. 915 of Lect. Notes in Comput. Sci., pp. 288-302, Springer-Verlag, 1995.