The μ-calculus alternation-depth hierarchy is strict on binary trees

RAIRO - Theoretical Informatics and Applications

Volumn 33, Issue 4-5, 1999, Pages 329-339

  Arnold, André ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Alternating automata; Mu calcul; Parity games

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL LINGUISTICS; MATHEMATICAL OPERATORS; SET THEORY; THEOREM PROVING;

BRADFIELD'S TREE LANGUAGE; LAMBDA CALCULUS; LENZI'S TREE LANGUAGE; WALUKIEWICZ'S TREE LANGUAGE;

TREES (MATHEMATICS);

EID: 0033295153     PISSN: 09883754     EISSN: 1290385X     Source Type: Journal    
DOI: 10.1051/ita:1999121     Document Type: Article

References (17)

1. A. Arnold, Logical definability of fixed points. Theoret. Comput. Sci. 61 (1988) 289-297.
2. A. Arnold and M. Nivat, The metric space of infinite trees. Algebraic and topological properties. Fund. Inform. 4 (1980) 445-476.
3. A. Arnold and D. Niwihski, Fixed-point characterization of biichi automata on infinite trees. J. Inf. Process. Cybern. EIK 26 (1990).
4. A. Arnold and D. Niwihski, Fixed point characterization of weak monadic logic definable sets of trees, M. Nivat and A. Podelski, Eds., Tree automata and Languages. Elsevier (1992) 159-188.
5. J.C. Bradfield, Fixpoint alternation: Arithmetic, transition systems, and the binary tree, this issue.
6. J.C. Bradfield, The modal mu-calculus alternation hierarchy is strict, U. Montanari and V. Sassone, Eds., in Proc. CONCUR’96, Lecture Notes in Comput. Sci. 1119 (1996) 233-246.
7. J.C. Bradfield, Simplifying the modal mu-calculus alternation hierarchy, M. Morvan, C. Meinel and D. Krob, Eds., in Proc. STACS’98, Lecture Notes in Comput. Sci. 1373 (1998) 39-49.
8. E.A. Emerson and C.S. Jutla, Tree automata, mu-calculus and determinacy, in Proc. FOCS’91. IEEE Computer Society Press (1991) 368-377.
9. Y. Gurevitch and L. Harrington, Trees, automata and games, in Proc. 14th ACM Symp. On the Theory of Computing (1982) 60-65.
10. G. Lenzi, A hierarchy theorem for the mu-calculus, F. Meyer auf der Heide and B. Monien, Eds., in Proc. ICALP’96, Lecture Notes in Comput. Sci. 1099 (1996) 87-109.
11. A.W. Mostowski, Hierarchies of weak automata and weak monadic formulas. Theoret. Comput. Sci. 83 (1991) 323-335.
12. D. E. Muller, A. Saoudi and P.E. Schupp, Alternating automata, the weak monadic theory of the tree and its complexity. Theoret. Comput. Sci. 97 (1992) 233-244.
13. D.E. Muller and P.E. Schupp, Alternating automata on infinite trees, Theoret. Comput. Sci. 54 (1987) 267-276.
14. D. Niwihski, On fixed point clones, L. Kott, Ed., in Proc. 13th ICALP, Lecture Notes in Comput. Sci. 226 (1986) 464-473.
15. D. Niwihski, Fixed points characterization of infinite behaviour of finite state systems. Theoret. Comput. Sci. 189 (1997) 1-69.
16. W. Thomas, A hierarchy of sets of infinite trees, A.B. Cremers and H.P. Kriegel, Eds., Theoret. Comput. Sci., Lecture Notes in Comput. Sci. 145 (1983) 335-342.
17. I. Walukiewicz, Monadic second-order logic on tree-like structures, C. Puech and R. Reischuk, Eds., in Proc. STACS’96, Lecture Notes in Comput. Sci. 1046 (1996) 401-414.