Janin, David, and Giacomo 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, http://147.213.75.17/ojs/index.php/cai/article/view/495.