1. Arnold, A.: The $$\mu $$ -calculus alternation-depth hierarchy is strict on binary trees. ITA 33(4/5), 329–340 (1999)
2. Arnold, A., Santocanale, L.: Ambiguous classes in $$\mu $$ -calculi hierarchies. TCS 333(1–2), 265–296 (2005)
3. Lecture Notes in Computer Science;J Bradfield,1998
4. Carayol, A., Löding, C., Niwiński, D., Walukiewicz, I.: Choice functions and well-orderings over the infinite binary tree. Cent. Eur. J. Math. 8, 662–682 (2010)
5. Colcombet, T.: Forms of determinism for automata (invited talk). In: STACS, pp. 1–23 (2012)