Janin, David, and Giacomo Lenzi. “On the Logical Definability of Topologically Closed Recognizable Languages of Infinite Trees”. Computing and Informatics 21, no. 3 (February 21, 2012): 185–203. Accessed May 9, 2025. https://www.cai.sk/ojs/index.php/cai/article/view/495.