A gap property of deterministic tree languages

Theoretical Computer Science

Volumn 303, Issue 1, 2003, Pages 215-231

  Niwiński, Damian ^a   Walukiewicz, Igor ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FINITE AUTOMATA; TREES (MATHEMATICS);

BOREL HIERARCHY;

COMPUTER SCIENCE;

EID: 0038040512     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00452-8     Document Type: Conference Paper

References (29)

1. Arnold A. The. μ -calculus alternation-depth hierarchy is strict on binary trees RAIRO-Theoret. Inform. Appl. 33:1999;329-339.
2. Arnold A., Niwiński D. Fixed point characterization of weak monadic logic definable sets of trees. Nivat M., Podelski A. Tree Automata and Languages. 1992;159-188 Elsevier, Amsterdam.
3. Arnold A., Niwiński D. Rudiments of. μ-Calculus, Studies in Logic:2001;North-Holland, Elsevier, Amsterdam.
4. Bradfield J.C. The modal mu-calculus alternation hierarchy is strict. Theoret. Comput. Sci. 195:1997;133-153.
5. Carton O., Maceiras R. Computing the Rabin index of a parity automaton. RAIRO Theoret. Inform. Appl. 33:1999;495-505.
6. Emerson E.A., Jutla C.S., Sistla A.P. On model-checking for fragments of. μ -calculus Proc. CAV'93. Lecture Notes in Computer Science. Vol. 697:1993;385-396 Springer, Berlin.
7. Gecség F., Steinby M. Tree Automata. 1984;Akadémiai Kiado, Budapest.
8. Kechris A.S. Classical Descriptive Set Theory. 1994;Springer, Heidelberg, New York.
9. Lenzi G. A hierarchy theorem for the mu-calculus. auf der Heide F.M., Monien B. Proc. ICALP '96. Lecture Notes in Computer Science. Vol. 1099:1996;87-109 Springer, Berlin.
10. McNaughton R. Testing and generating infinite sequences by a finite automaton. Inform. and Control. 9:1966;521-530.
11. Mostowski A.W. Hierarchies of weak automata and weak monadic formulas. Theoret. Comput. Sci. 83:1991;323-335.
12. Muller D.E., Saoudi A., Schupp P.E. Alternating automata and a weak monadic theory of the tree and its complexity. Kott L. 13th ICALP'86. Lecture Notes in Computer Science. Vol. 226:1986;275-283.
13. Muller D.E., Schupp P.E. Alternating automata on infinite trees. Theoret. Comput. Sci. 54:1987;267-276.
14. D. Niwiński, An example of non-Borel set of infinite trees recognizable by a Rabin automaton Manuscript, University of Warsaw, 1985, p. 9 (in Polish).
15. D. Niwiński, On fixed point clones, in: L. Kott (Ed.), 13th ICALP'86, Lecture Notes in Computer Science, Vol. 226, 1986, pp. 464-473.
16. Niwiński D., Walukiewicz I. Relating hierarchies of word and tree automata. STACS'98. Lecture Notes in Computer Science. Vol. 1373:1998;320-331 Springer, Berlin.
17. Otto M. Eliminating recursion in the mu-calculus. STACS'99. Lecture Notes in Computer Science. Vol. 1563:1999;531-540 Springer, Berlin.
18. D. Park, Concurrency and automata on infinite sequences, in: 5th G.I. Conf. on Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 104, Springer, Berlin, 1981, pp. 167-183.
19. Rabin M.O. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Soc. 141:1969;1-35.
20. Rabin M.O. Weakly definable relations and special automata. Bar-Hillel Y. Mathematical Logic and Foundation of Set Theory. 1970;1-23 North-Holland, Amsterdam.
21. S. Safra, On the complexity of ω -automata, in: 29th IEEE Symp. on Foundations of Computer Science, 1988.
22. Seidl H. Deciding equivalence of finite tree automata. SIAM J. Comput. 19:1990;424-437.
23. Skurczynski J. The Borel hierarchy is infinite in the class of regular sets of trees. Theoret. Comput. Sci. 112:1993;413-418.
24. W. Thomas, A hierarchy of sets of infinite trees, in: Theoretical Computer Science Proc., Lecture Notes in Computer Science, Vol. 145, 1983, pp. 335-342.
25. Thomas W. Automata on infinite objects. Van Leeuwen J. Handbook of Theoretical Computer Science. Vol. B:1990;133-191 Elsevier Science Pub. Amsterdam.
26. Thomas W. Languages, automata, and logic. Rozenberg G., Salomaa A. Handbook of Formal Languages. Vol. 3:1997;389-455 Springer, Berlin.
27. Urbański T.F. On deciding if deterministic Rabin language is in Büchi class. Montanari J.R.U., Welzl E. Proc. ICALP 2000. Lecture Notes in Computer Science. Vol. 1853:2000;663-674 Springer, Berlin.
28. Wagner K. Eine topologische Charakterisierung einiger Klassen regulärer Folgenmengen. J. Inform. Process. Cybern. EIK. 13:1977;473-487.
29. Wilke T., Yoo H. Computing the Rabin index of a regular language of infinite words. Inform. and Comput. 130:1996;61-70.