M. Adler and N. Immerman, An n! lower bound on formula size, ACM Transactions on Computational Logic, vol.4, issue.3, pp.296-314, 2003.
DOI : 10.1145/772062.772064

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

S. Cho and D. T. Huynh, Finite-automaton aperiodicity is PSPACE-complete, Theoretical Computer Science, vol.88, issue.1, pp.96-116, 1991.
DOI : 10.1016/0304-3975(91)90075-D
URL : http://doi.org/10.1016/0304-3975(91)90075-d

V. Diekert and P. Gastin, Pure future local temporal logics are expressively complete for Mazurkiewicz traces, LATIN 2004, pp.1597-1619, 2004.
DOI : 10.1016/j.ic.2006.07.002
URL : https://hal.archives-ouvertes.fr/hal-00130678

V. Diekert and P. Gastin, First-order definable languages, Logic and Automata: History and Perspectives, Texts in Logic and Games, pp.261-306, 2008.

P. Volker-diekert, M. Gastin, and . Kufleitner, A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS, International Journal of Foundations of Computer Science, vol.19, issue.03, pp.513-548, 2008.
DOI : 10.1142/S0129054108005802

K. Etessami, M. Y. Vardi, and T. Wilke, First-Order Logic with Two Variables and Unary Temporal Logic, Information and Computation, vol.179, issue.2, pp.279-295, 2002.
DOI : 10.1006/inco.2001.2953

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

M. Grohe and N. Schweikardt, The succinctness of first-order logic on linear orders, Logical Methods in Computer Science, vol.1, pp.1-25, 2005.

T. E. Hall and P. Weil, On Radical Congruence Systems, Semigroup Forum, vol.59, issue.1, pp.56-73, 1999.
DOI : 10.1007/s002339900032

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

M. Kufleitner, Polynomials, Fragments of Temporal Logic and the Variety DA over Traces, Theoretical Computer Science, vol.376, pp.89-100, 2006.
DOI : 10.1007/11779148_5

M. Kufleitner and P. Weil, On FO 2 Quantifier Alternation over Words, number 5734 in Lecture Notes in Computer Science, pp.513-524, 2009.
DOI : 10.1007/978-3-540-74915-8_27
URL : https://hal.archives-ouvertes.fr/hal-00376640

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 A. Lauser, Lattices of Logical Fragments over Words, 2012.
DOI : 10.1007/978-3-642-31585-5_27

K. Lodaya, P. K. Pandya, and S. S. Shah, Marking the chops: an unambiguous temporal logic, IFIP TCS 2008, pp.461-476, 2008.
DOI : 10.1007/978-0-387-09680-3_31

R. Mcnaughton and S. Papert, Counter-Free Automata, 1971.

J. Pin, Proprietes syntactiques du produit non ambigu, Proc.7th International Colloquium Automata, Languages and Programming, pp.483-499, 1980.
DOI : 10.1007/3-540-10003-2_93

J. Pin, Varieties of Formal Languages Expressive power of existential first-order sentences of Büchi's sequential calculus Locally trivial categories and unambiguous concatenation, North Oxford Academic Discrete Mathematics Journal of Pure and Applied Algebra, vol.2122, issue.52, pp.155-174297, 1986.

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

M. Paul and S. , On finite monoids having only trivial subgroups, Information and Control, vol.8, pp.190-194, 1965.

M. Paul and S. , Sur le produit de concaténation non ambigu, Semigroup Forum, vol.13, pp.47-75, 1976.

T. Schwentick, D. Thérien, and H. Vollmer, Partially-Ordered Two-Way Automata: A New Characterization of DA, Proc. of the 5th Int. Conf. on 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

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 FO 2 [<] on finite words, Proc. Computer Science Logic (CSL'11 Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.525-537, 2011.

H. Straubing and P. Weil, An introduction to automata theory, Modern applications of automata theory, pp.3-43, 2012.

H. Straubing, P. Weil, and . Varieties, Handbook of Finite Automata

P. Tesson and D. Thérien, DIAMONDS ARE FOREVER: THE VARIETY DA, Semigroups, Algorithms, Automata and Languages, pp.475-500, 2001.
DOI : 10.1142/9789812776884_0021

P. Tesson and D. Thérien, Logic Meets Algebra: the Case of Regular Languages, Logical Methods in Computer Science, vol.3, issue.1, pp.1-37, 2007.
DOI : 10.2168/LMCS-3(1:4)2007

D. Thérien and T. Wilke, Over words, two variables are as powerful as one quantifier alternation, Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, pp.234-240, 1998.
DOI : 10.1145/276698.276749

W. Thomas, Classifying regular events in symbolic logic, Journal of Computer and System Sciences, vol.25, issue.3, pp.360-376, 1982.
DOI : 10.1016/0022-0000(82)90016-2

P. Trotter and P. Weil, The lattice of pseudovarieties of idempotent semigroups and a non-regular analogue, Algebra Universalis, vol.37, issue.4, pp.491-526, 1997.
DOI : 10.1007/s000120050033

P. Weis and N. Immerman, Structure Theorem and Strict Alternation Hierarchy for FO2 on Words, Computer Science Logic, 21st International Workshop, CSL 2007, Proceedings, pp.343-357, 2007.
DOI : 10.1007/978-3-540-74915-8_27

P. Weis and N. Immerman, Structure theorem and strict alternation hierarchy for FO 2 on words University of Stuttgart, Germany E-mail address: kufleitner@fmi.uni-stuttgart.de CNRS, LaBRI, Logical Methods in Computer Science, vol.5, issue.5800, pp.1-23, 2009.