J. A. Brzozowski and B. Liu, Quotient complexity of star-free languages. Internat, J. Found. Comput. Sci, vol.23, issue.6, pp.1261-1276, 2012.

J. A. Brzozowski and M. Szykula, Large aperiodic semigroups, Internat. J. Found. Comput. Sci, vol.26, issue.7, pp.913-932, 2015.

C. Câmpeanu, I. I. Culik, K. Salomaa, K. Yu, and S. , State complexity of basic operations on finite languages, 1999.

, LNCS, vol.2214, pp.60-70, 1999.

M. Domaratzki and A. Okhotin, State complexity of power, Theoret. Comput. Sci, vol.410, pp.2377-2392, 2009.

V. Geffert, Magic numbers in the state hierarchy of finite automata, Inform. and Comput, vol.205, issue.11, pp.1652-1670, 2007.

M. Holzer and M. Kutrib, Nondeterministic descriptional complexity of regular languages, Internat. J. Found. Comput. Sci, vol.14, issue.6, pp.1087-1102, 2003.

M. Holzer, M. Kutrib, and K. Meckel, Nondeterministic state complexity of star-free languages, Theoret. Comput. Sci, vol.450, pp.68-80, 2012.

J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, 1979.

J. M. Howie, Products of idempotents in certain semigroups of transformations, Proc. Edinburgh Math. Soc, vol.17, issue.3, pp.223-236, 1971.

G. Jirásková, State complexity of some operations on binary regular languages, Theoret. Comput. Sci, vol.330, issue.2, pp.287-298, 2005.

E. L. Leiss, Succint representation of regular languages by boolean automata. Theoret, Comput. Sci, vol.13, pp.80005-80014, 1981.

A. N. Maslov, Estimates of the number of states of finite automata, Soviet Math. Doklady, vol.11, pp.1373-1375, 1970.

G. Pighizzini and J. Shallit, Unary language operations, state complexity and Jacobsthal's function, Internat. J. Found. Comput. Sci, vol.13, issue.1, pp.145-159, 2002.

N. Rampersad, The state complexity of L 2 and L k, Inform. Process. Lett, vol.98, issue.6, pp.231-234, 2006.

M. P. Schützenberger, On finite monoids having only trivial subgroups, Information and Control, vol.8, issue.2, pp.90108-90115, 1965.

M. Sipser, Introduction to the theory of computation, Cengage Learning, 2012.

S. Yu, Regular languages, Handbook of Formal Languages, vol.1, pp.41-110, 1997.

S. Yu, Q. Zhuang, and K. Salomaa, The state complexities of some basic operations on regular languages, Theoret. Comput. Sci, vol.125, issue.2, pp.315-328, 1994.