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

J. Goldstine, C. M. Kintala, and D. Wotschke, On measuring nondeterminism in regular languages, Inform. Comput, vol.86, issue.2, pp.179-194, 1990.

Y. S. Han, A. Salomaa, :. Salomaa, and K. , Ambiguity, nondeterminism and state complexity of finite automata, Acta Cybern, vol.23, issue.1, 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.

J. Hromkovi?, S. Seibert, J. Karhumäki, H. Klauck, and G. Schnitger, Communication complexity method for measuring nondeterminism in finite automata, Inform. Comput, vol.172, issue.2, pp.202-217, 2002.

C. Keeler and K. Salomaa, Branching measures and nearly acyclic NFAs, Proceedings of DCFS'17, pp.202-213, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01657000

C. Keeler and K. Salomaa, Cycle height of finite automata, Proceedings of DCFS'18, vol.10952, pp.200-211, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01905622

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

H. Leung, Separating exponentially ambiguous finite automata from polynomially ambiguous finite automata, SIAM J. Comput, vol.27, issue.4, pp.1073-1082, 1998.

H. Leung, Descriptional complexity of NFA of different ambiguity, Int. J. Found. Comput. Sci, vol.16, issue.5, pp.975-984, 2005.

A. Palioudakis, K. Salomaa, and S. G. Akl, State complexity of finite tree width NFAs, Journal of Automata, Languages and Combinatorics, vol.17, issue.2-4, pp.245-264, 2012.

A. Palioudakis, K. Salomaa, and S. G. Akl, Comparisons between measures of nondeterminism on finite automata, Proceedings of DCFS'13, vol.8031, pp.217-228, 2013.

B. Ravikumar, O. H. Ibarra, and J. Shallit, Relating the type of ambiguity of finite automata to the succinctness of their representation, A Second Course in Formal Languages and Automata Theory, vol.18, p.14, 1989.

A. Weber and H. Seidl, On the degree of ambiguity of finite automata, Theoret. Comput. Sci, vol.88, issue.2, pp.325-349, 1991.