J. Almeida, Profinite semigroups and applications, NATO Sci. Ser. II Math. Phys. Chem. Lect. Notes Comp. Sci, vol.207, pp.1-45, 2005.
DOI : 10.1007/1-4020-3817-8_1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.160.3717

D. A. Barrington, K. Compton, H. Straubing, and D. Thérien, Regular languages in NC 1, J. Comput. System Sci, vol.443, pp.478-499, 1992.

S. L. Bloom and Z. Esik, A Mezei???Wright theorem for categorical algebras, Theoretical Computer Science, vol.411, issue.2, pp.341-359, 2010.
DOI : 10.1016/j.tcs.2009.06.040

N. Bourbaki, General topology. Chapters 1?4, Elements of Mathematics, 1998.

D. M. Clark, B. A. Davey, R. S. Freese, and M. Jackson, Standard topological algebras: syntactic and principal congruences and profiniteness, algebra universalis, vol.52, issue.2-3, pp.2-3, 2004.
DOI : 10.1007/s00012-004-1917-6

M. Gehrke, S. Grigorieff, and J. Pin, Duality and Equational Theory of Regular Languages, Lect. Notes Comp. Sci, vol.5126, pp.246-257, 2008.
DOI : 10.1007/978-3-540-70583-3_21
URL : https://hal.archives-ouvertes.fr/hal-00340803

N. Hindman and D. Strauss, Algebra in the Stone-? Cech compactification, Theory and applications, 1998.

D. E. Muller and P. E. , Schupp, Groups, the theory of ends, and context-free languages, J. Comput. System Sci, vol.26, pp.3-295, 1983.

W. J. Pervin, Quasi-uniformization of topological spaces, Mathematische Annalen, vol.147, issue.4, pp.316-317, 1962.
DOI : 10.1007/BF01440953

J. Pin, A variety theorem without complementation, Russian Mathematics (Iz. VUZ), vol.39, pp.80-90, 1995.

J. Pin and P. Weil, UNIFORMITIES ON FREE SEMIGROUPS, International Journal of Algebra and Computation, vol.09, issue.03n04, pp.431-453, 1999.
DOI : 10.1142/S0218196799000266
URL : https://hal.archives-ouvertes.fr/hal-00113716

H. A. Priestley, Representation of Distributive Lattices by means of ordered Stone Spaces, Bulletin of the London Mathematical Society, vol.2, issue.2, pp.186-190, 1970.
DOI : 10.1112/blms/2.2.186

J. Sakarovitch, An algebraic framework for the study of the syntactic monoids application to the group languages, Lect. Notes Comp. Sci, vol.45, pp.510-516, 1976.
DOI : 10.1007/3-540-07854-1_222

H. Straubing, Finite automata, formal logic, and circuit complexity, Progress in Theoretical Computer Science, 1994.
DOI : 10.1007/978-1-4612-0289-9

W. Thomas, Uniform and nonuniform recognizability, Theoretical Computer Science, vol.292, issue.1, pp.299-316, 2003.
DOI : 10.1016/S0304-3975(01)00229-8

T. Wilke, AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS, International Journal of Algebra and Computation, vol.03, issue.04, pp.447-489, 1993.
DOI : 10.1142/S0218196793000287