Back to Search Start Over

Factoriality and the Pin-Reutenauer procedure

Authors :
J. Almeida
J. C. Costa
M. Zeitoun
Source :
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 18 no. 3, Iss Automata, Logic and Semantics (2016)
Publication Year :
2016
Publisher :
Discrete Mathematics & Theoretical Computer Science, 2016.

Abstract

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.

Details

Language :
English
ISSN :
13658050
Volume :
. 18
Issue :
Automata, Logic and Semantics
Database :
Directory of Open Access Journals
Journal :
Discrete Mathematics & Theoretical Computer Science
Publication Type :
Academic Journal
Accession number :
edsdoj.8fa01b9fc5cb4decbe8e62cbe167dde3
Document Type :
article
Full Text :
https://doi.org/10.46298/dmtcs.650