1. Arnold, A., Niwiński, D.: Fixed point characterisation of weak monadic logic definable sets of trees. In: Tree Automata and Languages, pp. 159–188 (1992)
2. Lecture Notes in Computer Science;JC Bradfield,1996
3. Bernholtz, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking (extended abstract). In: CAV, pp. 142–155 (1994)
4. Duparc, J., Facchini, A., Murlak, F.: Definable operations on weakly recognizable sets of trees. In: FSTTCS, pp. 363–374 (2011)
5. Lecture Notes in Computer Science;J Duparc,2007