Janin, D.; Lenzi, G. On the Logical Definability of Topologically Closed Recognizable Languages of Infinite Trees. Comput. Inform. 2012, 21, 185-203.