D. Janin and G. Lenzi, “On the logical definability of topologically closed recognizable languages of infinite trees”, Comput. Inform., vol. 21, no. 3, pp. 185–203, Feb. 2012.