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