JANIN, David; LENZI, Giacomo. On the logical definability of topologically closed recognizable languages of infinite trees. Computing and Informatics, [S. l.], v. 21, n. 3, p. 185–203, 2012. Disponível em: http://147.213.75.17/ojs/index.php/cai/article/view/495. Acesso em: 23 nov. 2024.