Janin, D. and Lenzi, G. (2012) “On the logical definability of topologically closed recognizable languages of infinite trees”, Computing and Informatics, 21(3), pp. 185–203. Available at: http://147.213.75.17/ojs/index.php/cai/article/view/495 (Accessed: 23 November 2024).