H. Bordihn, M. Holzer, and M. Kutrib, Determination of finite automata accepting subregular languages, Theoretical Computer Science, vol.410, issue.35, pp.3209-3222, 2009.
DOI : 10.1016/j.tcs.2009.05.019
URL : https://doi.org/10.1016/j.tcs.2009.05.019

C. S. Calude, K. Salomaa, and S. Yu, Additive distances and quasi-distances between words, J. Univ. Comput. Sci, vol.8, issue.2, pp.141-152, 2002.

C. Câmpeanu, I. Culik, K. Salomaa, K. Yu, and S. , State Complexity of Basic Operations on Finite Languages, Proc. WIA'99, pp.60-70, 1999.
DOI : 10.1007/3-540-45526-4_6

C. Choffrut and G. Pighizzini, Distances between languages and reflexivity of relations, Theoretical Computer Science, vol.286, issue.1, pp.117-138, 2002.
DOI : 10.1016/S0304-3975(01)00238-9
URL : https://doi.org/10.1016/s0304-3975(01)00238-9

M. M. Deza and E. Deza, Encyclopedia of Distances, 2009.
DOI : 10.1007/978-3-642-00234-2

Y. Gao, N. Moreira, R. Reis, and S. Yu, A review on state complexity of individual operations. Faculdade de Ciencias

Y. S. Han, K. Salomaa, and D. Wood, State Complexity of Prefix-Free Regular Languages, Proceedings of the 8th International Workshop on Descriptive Complexity of Formal Systems, pp.165-176, 2006.

M. Holzer, S. Jakobi, and M. Kutrib, THE MAGIC NUMBER PROBLEM FOR SUBREGULAR LANGUAGE FAMILIES, International Journal of Foundations of Computer Science, vol.2, issue.01, pp.115-131, 2012.
DOI : 10.1007/BF01761710
URL : http://arxiv.org/pdf/1008.1653

M. Holzer and M. Kutrib, Descriptional and computational complexity of finite automata???A survey, Information and Computation, vol.209, issue.3, pp.456-470, 2011.
DOI : 10.1016/j.ic.2010.11.013

M. Holzer, M. Kutrib, and K. Meckel, Nondeterministic state complexity of star-free fanguages, Proc. CIAA 2011, pp.178-189, 2011.
DOI : 10.1016/j.tcs.2012.04.028
URL : https://doi.org/10.1016/j.tcs.2012.04.028

M. Holzer and B. Truthe, On relations between some subregular language families, Proc. NCMA 2015, pp.109-124, 2015.

J. Y. Kao, N. Rampersad, and J. Shallit, On NFAs where all states are final, initial, or both, Theoretical Computer Science, vol.410, issue.47-49, pp.47-49, 2009.
DOI : 10.1016/j.tcs.2009.07.049
URL : https://doi.org/10.1016/j.tcs.2009.07.049

M. Kutrib and G. Pighizzini, Recent trends in descriptional complexity of formal languages, Bulletin of the EATCS, vol.111, pp.70-86, 2013.

T. Ng, D. Rappaport, and K. Salomaa, State Complexity of Prefix Distance, Implementation and Application of Automata, pp.238-249, 2015.
DOI : 10.1007/978-3-319-22360-5_20
URL : https://hal.archives-ouvertes.fr/hal-01633944

J. Shallit, A second course in formal languages and automata theory, 2009.
DOI : 10.1017/CBO9780511808876

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