C. Banderier and S. R. Schwer, Why Delannoy numbers?, J. Statist. Plann. Inference, vol.135, pp.40-54, 2004.
DOI : 10.1016/j.jspi.2005.02.004
URL : https://hal.archives-ouvertes.fr/hal-00085552

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2009.

P. Gawrychowski, D. Krieger, N. Rampersad, and J. Shallit, Finding the growth rate of a regular or context-free language in polynomial time, Int. J. Found. Comput. Sci, vol.21, issue.4, pp.597-618, 2010.

J. Goldstine, M. Kappes, C. M. Kintala, H. Leung, A. Malcher et al., Descriptional Complexity of Machines with Limited Resources, Journal of Universal Comput. Sci, vol.8, issue.2, pp.193-234, 2002.

H. Gruber, Digraph Complexity Measures and Applications in Formal Language Theory, Discrete Mathematics & Theoretical Computer Science, vol.14, issue.2, pp.189-204, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00990597

H. Gruber and M. Holzer, From Finite Automata to Regular Expressions and BackA Summary on Descriptional Complexity, Int. J. Found. Comput. Sci, vol.26, issue.8, pp.1009-1040, 2015.

Y. Han, A. Salomaa, and K. Salomaa, Ambiguity, nondeterminism and state complexity of finite automata, Acta Cybernetica, vol.23, pp.141-157, 2017.

M. Holzer and M. Kutrib, Descriptional and Computational Complexity of Finite Automata-A Survey, Inform. Comput, vol.209, issue.3, pp.456-470, 2011.

M. Keeler and K. Salomaa, Branching measures and nearly acyclic NFAs, Proceeding of DCFS 2017, vol.10316, pp.202-213, 2017.
DOI : 10.1007/978-3-319-60252-3_16
URL : https://hal.archives-ouvertes.fr/hal-01657000

M. Kutrib and G. Pighizzini, Recent Trends in Descriptional Complexity of Formal Languages, Bulletin of the EATCS, vol.111, 2013.

M. Kutrib, K. Meckel, and M. Wendlandt, Parameterized Prefix Distance between Regular Languages, SOFSEM 2014, vol.8327, pp.419-430, 2014.
DOI : 10.1007/978-3-319-04298-5_37

M. Msiska and L. Van-zijl, Interpreting the subset construction using finite sublanguages, Proceedings of Prague Stringology Conference, pp.48-62, 2016.

R. K. Ahuja, K. Mehlhorn, J. B. Orlin, and R. E. Tarjan, Faster Algorithms for the Shortest Path Problem, J. ACM, vol.37, issue.2, pp.213-223, 1990.
DOI : 10.1145/77600.77615
URL : https://publikationen.sulb.uni-saarland.de/bitstream/20.500.11880/26185/1/fb14_1988_04.pdf

J. Shallit, Second Course in Formal Languages and Automata Theory, 2009.

A. Szilard, S. Yu, K. Zhang, and J. Shallit, Characterizing Regular Languages with Polynomial Densities, pp.494-503, 1992.
DOI : 10.1007/3-540-55808-x_48

R. E. Tarjan, Depth-First Search and Linear Graph Algorithms, SIAM J. Comput, vol.1, issue.2, pp.146-160, 1972.
DOI : 10.1109/swat.1971.10

J. J. Tattersall, Elementary Number Theory in Nine Chapters, 2005.

C. K. Wong and T. W. Maddocks, A generalized Pascal's triangle, Fibonacci Quart, vol.13, issue.2, pp.134-136, 1975.