Computing the Rabin Index of a Regular Language of Infinite Words

Information and Computation

Volumn 130, Issue 1, 1996, Pages 61-70

  Wilke, Thomas ^a   Yoo, Haiseung ^b  

^a UNIVERSITY OF KIEL   (Germany)

^b UNIVERSITY OF PASSAU   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037766031     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0082     Document Type: Article

References (10)

1. Barua, R. (1992), The Hausdorff-Kuratowski hierarchy of co-regular languages and a hierarchy of Muller automata, Theoret. Comput. Sci. 96, 345-360.
2. Krishnan, S. C., Puri, A., and Brayton, R. K. (1995), Structural complexity of ω-automata, in "Proceedings, STAGS 95: 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany" (E. W. Mayr and C. Puech, Eds.), Lecture Notes in Computer Science, Vol. 900, pp. 143-156, Springer-Verlag, Berlin/Heidelberg/New York.
3. McNaughton, R. (1966), Testing and generating infinite sequences by a finite automaton, Information and Control (5) 9, 521-530.
4. Rabin, M. O. (1969), Decidability of second-order theories and finite automata on infinite trees, Trans. Amer. Math. Soc. 141, 1-35.
5. Safra, S. (1988), On the complexity of ω-automata, in "Proceedings, 29th Annual Symposium on Foundations of Computer Science, White Plains, New York," pp. 319-327.
6. Thomas, W. (1990), Automata on infinite objects, in "Handbook of Theoretical Computer Science" (Jan van Leeuwen, Ed.), Vol. B, pp. 134-191, Elsevier, Amsterdam.
7. Wagner, K. W. (1977), Eine topologische Charakterisierung einiger Klassen regulärer Folgenmengen, Elektron. Informationsverarb. Kybernet. (9) 13, 473-487.
8. Wagner, K. W. (1979), On ω-regular sets, Inform. and Control (2) 43, 123-177.
9. Wilke, Th., and Yoo, H. (1995), Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time, in "Proceedings, Tapsoft '95: Theory and Practice of Software Development, Aarhus, Denmark" (P. D. Mosses et al., Eds.), Lecture Notes in Computer Science, Vol. 915, pp. 288-302, Springer-Verlag, Berlin/Heidelberg/New York.
10. Yoo, H. (1994), "Ein effizienter Algorithmus zur Bestimmung des Rabin-Index in Muller-Automaten," diploma thesis, Inst. f. Inform, u. Prakt. Math, Christian-Albrechts-Universität zu Kiel, Kiel, Germany.