On deciding topological classes of deterministic tree languages

Lecture Notes in Computer Science

Volumn 3634, Issue , 2005, Pages 428-441

  Murlak, Filip ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

Borel hierarchy; Deterministic tree automata; Index hierarchy

Indexed keywords

AUTOMATION; HIERARCHICAL SYSTEMS; TREES (MATHEMATICS);

BOREAL HIERARCHY; DETERMINISTIC TREE AUTOMATA; INDEX HIERARCHY; TREE LANGUAGE;

COMPUTER PROGRAMMING LANGUAGES;

EID: 26944448171     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538363_30     Document Type: Conference Paper

References (19)

1. Bradfield, J. C.: The modal mu-calculus alternation hierarchy is strict. Theoret. Comput. Sci. 195 (1998) 133-153
2. Browne, A., Clarke, E. M., Jha, S., Long, D. E., Marrero, W.: An unproved algorithm for the evaluation of fixpoint expressions. Theoret. Comput. Sci. 178 (1997) 237-255
3. Emerson, E. A., Jutla, C. S.: The complexity of tree automata and logics of programs. In: Proc. FoCS '88. IEEE Computer Society Press (1988) 328-337
4. Jurdziński, M., Vöge, J.: A discrete strategy improvement algorithm for solving parity games. In: Proc. CAV 2000. Lecture Notes in Computer Science, Vol. 1855. Springer-Verlag (2000) 202-215
5. Kechris, A. S.: Classical Descriptive Set Theory. Graduate Texts in Mathematics, Vol. 156. Springer-Verlag (1995)
6. Kupferman, O., Safra, S., Vardi, M.: Relating Word and Tree Automata. In: 11th IEEE Symp. on Logic in Comput. Sci. (1996) 322-332
7. Lenzi, G.: A hierarchy theorem for the mu-calculus. In: auf der Heide, F. M., Monien, B. (eds.): Proc. ICALP '96. Lecture Notes in Computer Science, Vol. 1099. Springer-Verlag (1996) 87-109
8. Mostowski, A. W.: Hierarchies of weak automata and weak monadic formulas. Theoret. Comput. Sci. 83 (1991) 323-335.
9. Niwiński, D.: On fixed point clones. In: Kott, L. (ed.): 13th ICALP '86. Lecture Notes in Computer Science, Vol. 226. Springer-Verlag (1986) 464-473
10. Niwiński, D., Walukiewicz, I.: Relating hierarchies of word and tree automata. In: STACS '98. Lecture Notes in Computer Science, Vol. 1373. Springer-Verlag (1998) 320-331
11. Niwiński, D., Walukiewicz, I.: A gap property of deterministic tree languages. Theoret. Comput. Sci. 303 (2003) 215-231
12. Niwiński, D., Walukiewicz, I.: Deciding nondeterministic hierarchy of deterministic tree automata. In: Proc. WoLLiC 2004 (to appear in Electronic Notes in Theoretical Computer Science)
13. Otto, M.: Eliminating recursion in μ-calculus. In: STACS'99. Lecture Notes in Computer Science, Vol. 1563. Springer-Verlag (1999) 531-540
14. Rabin, M. O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Soc. 141 (1969) 1-35
15. Seidl, H.: Fast and simple nested fixpoints. Information Processing Letters 59 (1996) 303-308
16. Skurczyński, J.: The Borel hierarchy is infinite in the class of regular sets of trees. Theoret. Comput. Sci. 112 (1993) 413-418
17. Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, Vol. 3. Springer-Verlag (1997) 389-455
18. Urbański, T. F.: On deciding if deterministic Rabin language is in Büchi class. In: Montanari, J. R. U., Welzl, E. (eds.): Proc. ICALP 2000. Lecture Notes in Computer Science, Vol. 1853. Springer-Verlag (2000) 663-674
19. Wagner, K.: Eine topologische Charakterisierung einiger Klassen regulärer Folgenmengen. J. Inf. Process. Cybern. EIK 13 (1977) 473-487