Janin, D. and Lenzi, G. (2012) “On the logical definability of topologically closed recognizable languages of infinite trees”, COMPUTING AND INFORMATICS, 21(3), pp. 185–203. Available at: https://www.cai.sk/ojs/index.php/cai/article/view/495 (Accessed: 4 February 2023).