1.
Janin D, Lenzi G. On the logical definability of topologically closed recognizable languages of infinite trees. Comput. Inform. [Internet]. 2012 Feb. 21 [cited 2023 Feb. 4];21(3):185-203. Available from: https://www.cai.sk/ojs/index.php/cai/article/view/495