Closures of regular languages for profinite topologies

The Pin-Reutenauer algorithm gives a method, that can be viewed as a descriptive procedure, to compute the closure in the free group of a regular language with respect to the Hall topology. A similar descriptive procedure is shown to hold for the pseudovariety A of aperiodic semigroups, where the closure is taken in the free aperiodic omega-semigroup. It is inherited by a subpseudovariety of a given pseudovariety if both of them enjoy the property of being full. The pseudovariety A, as well as some of its subpseudovarieties are shown to be full. The interest in such descriptions stems from the fact that, for each of the main pseudovarieties V in our examples, the closures of two regular languages are disjoint if and only if the languages can be separated by a language whose syntactic semigroup lies in V. In the cases of A and of the pseudovariety DA of semigroups in which all regular elements are idempotents, this is a new result.PESSOA French-Portuguese project Egide-Grices 11113YM, "Automata, profinite semigroups and symbolic dynamics".FCT -- Fundação para a Ciência e a Tecnologia, respectively under the projects PEst-C/MAT/UI0144/2011 and PEst-C/MAT/UI0013/2011.ANR 2010 BLAN 0202 01 FREC.AutoMathA programme of the European Science Foundation.FCT and the project PTDC/MAT/65481/2006 which was partly funded by the European Community Fund FEDER