J. Almeida, Finite Semigroups and Universal Algebra, World Scientific, vol.3, 1994.
DOI : 10.1142/2481

J. A. Gerhard, The lattice of equational classes of idempotent semigroups, Journal of Algebra, vol.15, issue.2, pp.195-224, 1970.
DOI : 10.1016/0021-8693(70)90073-6

J. A. Gerhard and M. Petrich, Varieties of Bands Revisited, Proceedings of the London Mathematical Society, pp.323-350, 1989.
DOI : 10.1112/plms/s3-58.2.323

A. Krebs, H. Straubing, D. D-'souza, T. Kavitha, and J. Radhakrishnan, An effective characterization of the alternation hierarchy in two-variable logic, Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), volume 18 of Leibniz International Proceedings in Informatics (LIPIcs) Schloss Dagstuhl?Leibniz-Zentrum fuer Informatik, pp.86-98, 2012.

K. Krohn, J. Rhodes, and B. Tilson, Homomorphisms and semilocal theory The Algebraic Theory of Machines, Languages and Semigroups, 1965.

M. Kufleitner and P. Weil, On the lattice of??sub-pseudovarieties of??DA, Semigroup Forum, vol.33, issue.2, pp.243-254, 2010.
DOI : 10.1007/s00233-010-9258-6

URL : https://hal.archives-ouvertes.fr/hal-00376641

M. Kufleitner and P. Weil, The F O 2 alternation hierarchy is decidable, Computer Science Logic (CSL'12), volume 16 of Leibniz International Proceedings in Informatics (LIPIcs), pp.426-439, 2012.

M. Kufleitner and P. Weil, On logical hierarchies within F O 2 -definable languages, Logical Methods in Computer Science, vol.8, issue.311, pp.1-30, 2012.

J. Pin, Proprietes syntactiques du produit non ambigu, International Colloquium Automata, Languages and Programming 10. J.-´ E. Pin. Varieties of Formal Languages, pp.483-499, 1980.
DOI : 10.1007/3-540-10003-2_93

J. Rhodes and B. Steinberg, The q-theory of finite semigroups, 2009.
DOI : 10.1007/b104443

M. P. Schützenberger, Sur Le Produit De Concatenation Non Ambigu, Semigroup Forum, vol.7, issue.1, pp.47-75, 1976.
DOI : 10.1007/BF02194921

T. Schwentick, D. Thérien, and H. Vollmer, Partially-Ordered Two-Way Automata: A New Characterization of DA, Developments in Language Theory (DLT), volume 2295 of Lecture Notes in Computer Science, pp.239-250, 2001.
DOI : 10.1007/3-540-46011-X_20

I. Simon, Piecewise testable events, Automata Theory and Formal Languages, 2nd GI Conference, pp.214-222, 1975.
DOI : 10.1007/3-540-07407-4_23

H. Straubing, Finite Automata, Formal Logic, and Circuit Complexity, Birkhäuser, 1994.
DOI : 10.1007/978-1-4612-0289-9

H. Straubing, Algebraic Characterization of the Alternation Hierarchy in F O 2, of Leibniz International Proceedings in Informatics (LIPIcs), pp.525-537, 2011.

P. Weil, Some results on the dot-depth hierarchy, Semigroup Forum, vol.66, issue.1, pp.352-370, 1993.
DOI : 10.1007/BF02573578

P. Weis and N. Immerman, Structure theorem and strict alternation hierarchy for FO 2 on words, Logical Methods in Computer Science, vol.5, pp.1-23, 2009.