Computing the Rabin index of a parity automaton

Theoretical Informatics and Applications

Volumn 33, Issue 6, 1999, Pages 495-505

  Carton, Olivier ^a   Maceiras, Ramón ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS;

PARITY AUTOMATON; RABIN INDEX;

AUTOMATA THEORY;

EID: 0033296021     PISSN: 09883754     EISSN: None     Source Type: Journal    
DOI: 10.1051/ita:1999129     Document Type: Article

References (15)

1. J.R. Büchi, On a decision method in the restricted second-order arithmetic, in Proc. Int. Congress Logic, Methodology and Philosophy of science, Berkeley 1960. Stanford University Press (1962) 1-11.
2. O. Carton, Chain automata. Theoret. Comput. Sci. 161 (1996) 191-203.
3. E.A. Emerson and C.S. Jutla, Tree automata, Mu-calculus and determinacy, in Proc. 32th Symp. on Foundations of Computer Science (1991) 368-377.
4. S.C. Krishnan, A. Puri and R.K. Brayton, Structural complexity of ω-languages, in STACS '95, Springer-Verlag, Lectures Notes in Comput. Sci. 900 (1995) 143-156.
5. R. McNaughton, Testing and generating infinite sequences by a finite automaton. Inform. Control 9 (1966) 521-530.
6. A. Mostowski Regular expressions for infinite trees and a standard form for automata, in Computation theory, A. Skowron, Ed., Springer-Verlag, Berlin, Lectures Notes in Comput. Sci. 208 (1984) 157-168.
7. A. Mostowski, Hierarchies of weak automata and weak monadic formulas. Theoret. Comput. Sci. 83 (1991) 323-335.
8. D. Muller, Infinite sequences and finite machines, in Switching Theory and Logical Design, P. of Fourth Annual IEEE Symp., Ed. (1963) 3-16.
9. M.O. Rabin, Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141 (1969) 1-35.
10. R.E. Tarjan, Depth first search and linear graphs. SIAM J. Comput. 1 (1972) 146-160.
11. W. Thomas, Automata on infinite objects, in Handbook of Theoretical Computer Science, J. van Leeuwen, Ed., B (Elsevier, 1990) Chapter 4, pp. 133-191.
12. K. Wagner, Eine topologische Charakteriesierung einiger Klassen regulärer Folgenmengen. Elektron. Informationsverarb. Kybernet. 13 (1977) 505-519.
13. K. Wagner, On ω-regular sets. Inform. Control 43 (1979) 123-177.
14. T. Wilke and H. Yoo, Computing the Wadge degree, the Lipschitz degree, and the Rabin index of a regular language of infinite words in polynomial time, in Trees in Algebra and Programming - CAAP '95 P. M. et al., Ed., Springer-Verlag, Lectures Notes in Comput. Sci. 915 (1995) 288-302.
15. T. Wilke and H. Yoo, Computing the Rabin index of a regular language of infinite words. Inform. Comput. 130 (1996) 61-70.