J. Almeida, Finite semigroups and universal algebra. series in algebra Finite semigroups: an introduction to a unified theory of pseudovarieties , Semigroups, algorithms, automata and languages, World Scientific, vol.3, issue.2, 1995.

W. Sci and . Publ, [3] , Profinite semigroups and applications, Structural theory of automata , semigroups and universal algebra, pp.3-64, 2002.

J. Almeida, A. Cano, O. Klíma, and J. Pin, On fixed points of the lower set operator, International Journal of Algebra and Computation, vol.39, issue.01n02, pp.259-292, 2015.
DOI : 10.1142/S0218196702000912
URL : https://hal.archives-ouvertes.fr/hal-01247705

B. Banaschewski, The Birkhoff Theorem for varieties of finite algebras, Algebra Universalis, vol.23, issue.1, pp.360-368, 1983.
DOI : 10.1007/BF01194543

J. Berstel, L. Boasson, O. Carton, J. Pin, and A. Restivo, The expressive power of the shuffle product, Information and Computation, vol.208, issue.11, pp.1258-1272, 2010.
DOI : 10.1016/j.ic.2010.06.002
URL : https://hal.archives-ouvertes.fr/hal-00619766

J. J. Mário, J. Branco, and . Pin, Equations for the polynomial closure, Lect. Notes Comp. Sci, pp.115-126, 2009.

A. Cano and J. Pin, Upper set monoids and length preserving morphisms, Journal of Pure and Applied Algebra, vol.216, issue.5, pp.1178-1183, 2012.
DOI : 10.1016/j.jpaa.2011.10.022
URL : https://hal.archives-ouvertes.fr/hal-01247072

A. Cano and G. , Semigroupes ordonnés et opérations sur les langages rationnels, 2003.

A. Cano, G. , and J. Pin, Shuffle on positive varieties of languages, Theoret. Comput. Sci, vol.312, pp.433-461, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00112826

P. Cégielski, S. Grigorieff, and I. Guessarian, On lattices of regular sets of natural integers closed under decrementation, Information Processing Letters, vol.114, issue.4, pp.197-202, 2014.
DOI : 10.1016/j.ipl.2013.11.013

M. Zoltánzoltán´zoltánésik and . Ito, Temporal logic with cyclic counting and the degree of aperiodicity of finite automata, Acta Cybernetica, vol.16, pp.1-28, 2003.

I. Zoltanésikzoltan´zoltanésik and . Simon, Modeling literal morphisms by shuffle, Semigroup Forum, vol.56, pp.225-227, 1998.

M. Kunc, Equational description of pseudovarieties of homomorphisms, RAIRO - Theoretical Informatics and Applications, vol.8, issue.3, pp.243-254, 2003.
DOI : 10.1016/S0019-9958(65)90108-7

J. Perrot, Varietes de langages et operations, Theoretical Computer Science, vol.7, issue.2, pp.197-210, 1978.
DOI : 10.1016/0304-3975(78)90049-X

-. Jean, P. Pin, and . Weil, A Reiterman theorem for pseudovarieties of finite first-order structures, Algebra Universalis, vol.20, issue.35, pp.577-595, 1996.

L. Polák, Operators on classes of regular languages, Semigroups, Algorithms , Automata and Languages (Gracinda Gomes, World Scientific, pp.407-422, 2002.

J. Reiterman, The Birkhoff theorem for finite algebras, Algebra Universalis, vol.3, issue.2, pp.1-10, 1982.
DOI : 10.1007/BF02483902

C. Reutenauer, Sur les varietes de langages et de mono??des, Lect. Notes Comp. Sci, vol.67, pp.260-265, 1979.
DOI : 10.1007/3-540-09118-1_27

H. Straubing, Aperiodic homomorphisms and the concatenation product of recognizable sets, Journal of Pure and Applied Algebra, vol.15, issue.3, pp.319-327, 1979.
DOI : 10.1016/0022-4049(79)90025-2

P. Weil, PROFINITE METHODS IN SEMIGROUP THEORY, International Journal of Algebra and Computation, vol.39, issue.1, pp.137-178, 2002.
DOI : 10.1007/BF02573578