1. Arnold, A.: The μ-calculus alternation-depth hierarchy is strict on binary trees. RAIRO-Theoretical Informatics and Applications 33, 329–339 (1999)
2. Arnold, A., Michalewski, H., Niwiński, D.: On the separation question for tree languages. In: STACS 2012 (to appear, 2012)
3. Elsevier Science, Studies in Logic and the Foundations of Mathematics;A. Arnold,2001
4. Arnold, A., Niwiński, D.: Continuous separation of game languages. Fundamenta Informaticae 81(1-3), 19–28 (2007)
5. Bradfield, J.C.: The modal μ-calculus alternation hierarchy is strict. Theoret. Comput. Sci. 195, 133–153 (1997)