Janin, D., and G. Lenzi. “On the Logical Definability of Topologically Closed Recognizable Languages of Infinite Trees”. COMPUTING AND INFORMATICS, vol. 21, no. 3, Feb. 2012, pp. 185-03, https://www.cai.sk/ojs/index.php/cai/article/view/495.