J. A. Brzozowski, S. Davies, and B. Y. Liu, Most complex regular ideal languages, Discrete Math. Theoret. Comput. Sc, vol.18, issue.3, p.15, 2016.

J. A. Brzozowski, G. Jirásková, and C. Zou, Quotient complexity of closed languages, Theory Comput. Syst, vol.54, pp.277-292, 2014.

J. A. Brzozowski, In search of most complex regular languages, Int. J. Found. Comput. Sc, vol.24, issue.06, pp.691-708, 2013.

J. A. Brzozowski, Unrestricted state complexity of binary operations on regular languages, DCFS 2016, vol.9777, pp.60-72, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01633951

J. A. Brzozowski and S. Davies, Most complex non-returning regular languages, DCFS 2017, vol.10316, pp.89-101, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01656998

J. A. Brzozowski, G. Jirásková, and B. Li, Quotient complexity of ideal languages, Theoret. Comput. Sci, vol.470, pp.36-52, 2013.

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

J. A. Brzozowski and C. Sinnamon, Complexity of left-ideal, suffix-closed and suffixfree regular languages, LATA 2017, vol.10168, pp.171-182, 2017.
DOI : 10.1007/978-3-319-53733-7_12
URL : http://arxiv.org/pdf/1610.00728

J. A. Brzozowski and C. Sinnamon, Complexity of right-ideal, prefix-closed, and prefix-free regular languages, Acta Cybernetica, vol.23, issue.1, pp.9-41, 2017.
DOI : 10.14232/actacyb.23.1.2017.3
URL : http://www.inf.u-szeged.hu/actacybernetica/edb/vol23n1/pdf/actacyb_23_1_2017_3.pdf

C. Câmpeanu, K. Culik, K. Salomaa, and S. Yu, State complexity of basic operations on finite languages, WIA 1999, vol.2214, pp.60-70, 2001.

S. Davies, A new technique for reachability of states in concatenation automata, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01905633

H. S. Eom, Y. S. Han, and G. Jirásková, State complexity of basic operations on nonreturning regular languages, Fund. Inform, vol.144, pp.161-182, 2016.
DOI : 10.1007/978-3-642-39310-5_7

Y. S. Han, K. Salomaa, and D. Wood, Operational state complexity of prefix-free regular languages, pp.99-115, 2009.

Y. S. Han and K. Salomaa, State complexity of basic operations on suffix-free regular languages, Theoret. Comput. Sci, vol.410, pp.2537-2548, 2009.
DOI : 10.1016/j.tcs.2008.12.054
URL : https://doi.org/10.1016/j.tcs.2008.12.054

G. Jirásková and M. Krausová, Complexity in prefix-free regular languages, DCFS 2010, pp.236-244, 2010.

A. N. Maslov, Estimates of the number of states of finite automata, Dokl. Akad. Nauk SSSR, vol.194, pp.1373-1375, 1970.

C. Nicaud, Average state complexity of operations on unary automata, MFCS 1999, pp.231-240, 1999.
DOI : 10.1007/3-540-48340-3_21
URL : https://hal.archives-ouvertes.fr/hal-00620109

G. Pighizzini and J. Shallit, Unary language operations, state complexity and Jacobsthal's function, International Journal of Foundations of Computer Science, vol.13, issue.01, pp.145-159, 2002.

S. Yu, State complexity of regular languages, J. Autom. Lang. Comb, vol.6, pp.221-234, 2001.

S. Yu, Q. Zhuang, and K. Salomaa, The state complexities of some basic operations on regular languages, Theor. Comput. Sci, vol.125, issue.2, pp.315-328, 1994.
DOI : 10.1016/0304-3975(92)00011-f
URL : https://doi.org/10.1016/0304-3975(92)00011-f