Janin, David, and Giacomo Lenzi. 2012. “On the Logical Definability of Topologically Closed Recognizable Languages of Infinite Trees”. Computing and Informatics 21 (3):185-203. http://147.213.75.17/ojs/index.php/cai/article/view/495.