Weak index versus Borel rank

Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008

Volumn , Issue , 2008, Pages 573-584

  Murlak, Filip ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

Borel rank; Deterministic tree automata; Weak index

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

BOREL HIERARCHY; BOREL RANKS; DETERMINISTIC AUTOMATA; DETERMINISTIC TREE AUTOMATA; EMPTINESS PROBLEM; INDEX HIERARCHY; QUADRATIC NUMBER; WEAK INDEX;

FORESTRY;

EID: 45749098925     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. A. Arnold. The μ-calculus alternation-depth hierarchy is strict on binary trees. RAIRO-Theoretical Informatics and Applications 33 (1999) 329-339.
2. A. Arnold, D. Niwiriski. Fixed point characterisation of weak monadic logic definable sets of trees. Tree Automata and Languages, Elsevier 1992, 159-188.
3. A. Arnold, D. Niwiński. Continuous separation of game languages. Manuscript, submitted, 2006.
4. J. C. Bradfield. The modal mu-calculus alternation hierarchy is strict. Theoret. Comput. Sci. 195 (1998) 133-153.
5. J. Duparc, F. Murlak. On the topological complexity of weakly recognizable tree languages. Proc. FCT 2007, LNCS 4639 (2007) 261-273.
6. E. A. Emerson, C. S. Jutla. The complexity of tree automata and logics of programs. Proc FoCS '88, IEEE Computer Society Press 1988, 328-337.
7. O. Kupferman, M. Vardi. The weakness of self-complementation. Proc. STAGS '99, LNCS 1563 (1999) 455-466.
8. G. Lenzi. A hierarchy theorem for the mu-calculus. Proc ICALP '96, LNCS 1099 (1996) 87-109.
9. A. W. Mostowski. Hierarchies of weak automata and weak monadic formulas. Theoret. Comput. Sci. 83 (1991) 323-335.
10. D. E. Muller, A. Saoudi, P. E. Schupp. Alternating automata. The weak monadic theory of the tree, and its complexity. Proc. ICALP '86, LNCS 226 (1986) 275-283.
11. F. Murlak. On deciding topological classes of deterministic tree languages. Proc. CSL '05, LNCS 3634 (2005) 428-441.
12. J. Neumann, A. Szepietowski, I. Walukiewicz. Complexity of weak acceptance conditions in tree automata. IPL 84 (2002) 181-187.
13. D. Niwiński. On fixed point clones. Proc. ICALP '86, LNCS 226 (1986) 464-473.
14. D. Niwiński, I. Walukiewicz. Relating hierarchies of word and tree automata. Proc. STACS '98, LNCS 1373 (1998) 320-331.
15. D. Niwiński, I. Walukiewicz. A gap property of deterministic tree languages. Theoret. Comput. Sci. 303 (2003) 215-231.
16. D. Niwiński, I. Walukiewicz. Deciding nondeterministic hierarchy of deterministic tree automata. Proc. WoLLiC '04, Electronic Notes in Theoret. Comp. Sci. 2005, 195-208.
17. M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Soc. 141 (1969) 1-35.
18. M. O. Rabin. Weakly definable relations and special automata. Mathematical Logic and Foundations of Set Theory, North-Holland 1970, 1-70.
19. J. Skurczyński. The Borel hierarchy is infinite in the class of regular sets of trees. Theoret. Comput. Sci. 112 (1993) 413-418.
20. W. Thomas. A hierarchy of sets of infinite trees. Proc. Theoretical Computer Science, LNCS 145 (1982) 335-342.
21. K. Wagner. On w-regular sets. Inform. and Control 43 (1979) 123-177.