Factoriality and the pin-reutenauer procedure
| Data(s) |
15/03/2016
|
|---|---|
| Resumo |
We consider implicit signatures over finite semigroups determined by sets of pseudonatural numbers. We prove that, under relatively simple hypotheses on a pseudovariety V of semigroups, the finitely generated free algebra for the largest such signature is closed under taking factors within the free pro-V semigroup on the same set of generators. Furthermore, we show that the natural analogue of the Pin-Reutenauer descriptive procedure for the closure of a rational language in the free group with respect to the profinite topology holds for the pseudovariety of all finite semigroups. As an application, we establish that a pseudovariety enjoys this property if and only if it is full. European structural funds (FEDER) European Regional Development Fund, through the program COMPETE |
| Identificador |
1365-8050 |
| Idioma(s) |
eng |
| Publicador |
Discrete Mathematics and Theoretical Computer Science |
| Relação |
UID/MAT/ 00144/2013 info:eu-repo/grantAgreement/FCT/5876/135888/PT IdEx Bordeaux – CPU (ANR-10- IDEX-03-02) ANR 2010 BLAN 0202 01 FREC arxiv.org/pdf/1506.01074 |
| Direitos |
info:eu-repo/semantics/openAccess |
| Palavras-Chave | #Pseudovariety #Profinite semigroup #Profinite topology #Topological closure #Unary implicit signature #Pure implicit signature #Rational language #Aperiodic semigroup #Burnside pseudovariety #Factorial pseudovariety #Full pseudovariety #Pin-Reutenauer procedure |
| Tipo |
info:eu-repo/semantics/article |