Janin, D. and Lenzi, G. 2012. On the logical definability of topologically closed recognizable languages of infinite trees. COMPUTING AND INFORMATICS. 21, 3 (Feb. 2012), 185–203.