J. Bell, J. Brzozowski, N. Moreira, and R. Reis, Symmetric Groups and Quotient Complexity of Boolean Operations, ICALP 2014, pp.1-12, 2014.
DOI : 10.1007/978-3-662-43951-7_1

J. Brzozowski, Quotient Complexity of Regular Languages, Electronic Proceedings in Theoretical Computer Science, vol.125, issue.12, pp.71-89, 2010.
DOI : 10.1007/978-3-642-59136-5_2
URL : http://arxiv.org/pdf/0907.4547v1.pdf

J. Brzozowski, IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES, International Journal of Foundations of Computer Science, vol.6, issue.1, pp.691-708, 2013.
DOI : 10.1016/0304-3975(92)00011-F

J. Brzozowski and H. Tamm, COMPLEXITY OF ATOMS OF REGULAR LANGUAGES, International Journal of Foundations of Computer Science, vol.6, issue.1, pp.1009-1027, 2013.
DOI : 10.1016/j.tcs.2004.02.032

J. Brzozowski and H. Tamm, Theory of ??tomata, Theoretical Computer Science, vol.539, pp.13-27, 2014.
DOI : 10.1016/j.tcs.2014.04.016

Y. Gao, K. Salomaa, and S. Yu, Transition Complexity of Incomplete DFAs, Electronic Proceedings in Theoretical Computer Science, vol.31, pp.143-158, 2011.
DOI : 10.4204/EPTCS.31.12
URL : http://arxiv.org/pdf/1008.1652.pdf

S. Iván, Complexity of atoms, combinatorially, Information Processing Letters, vol.116, issue.5, pp.356-360, 2016.
DOI : 10.1016/j.ipl.2016.01.003

E. Maia, N. Moreira, and R. Reis, Incomplete operational transition complexity of regular languages, Information and Computation, vol.244, pp.1-22, 2015.
DOI : 10.1016/j.ic.2015.08.004

A. N. Maslov, Estimates of the number of states of finite automata, English translation: Soviet Math. Dokl, pp.1266-1268, 1970.

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, Theoretical Computer Science, vol.125, issue.2, pp.315-328, 1994.
DOI : 10.1016/0304-3975(92)00011-F