R. Alur and P. Madhusudan, Visibly pushdown languages, Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp.202-211, 2004.

R. Alur and P. Madhusudan, Adding nesting structure to words, Journal of the ACM, vol.56, issue.3, p.43, 2009.

H. Björklund and W. Martens, The tractability frontier for NFA minimization, Journal of Computer and System Sciences, vol.78, issue.1, pp.198-210, 2012.

M. Caralp, P. A. Reynier, and J. M. Talbot, Visibly pushdown automata with multiplicities: Finiteness and k-boundedness, Proceedings of DLT'12, pp.226-238, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00697091

T. Hung-chan and O. H. Ibarra, On the finite-valuedness problem for sequential machines, Theoretical Computer Science, vol.23, issue.1, pp.95-101, 1988.

H. Fernau and A. Krebs, Problems on finite automata and the exponential time hypothesis, Algorithms, vol.10, issue.1, 2017.

J. Goldstine, M. Kappes, C. M. Kintala, H. Leung, A. Malcher et al., Descriptional complexity of machines with limited resources, Journal of Universal Computer Science, vol.8, issue.2, pp.193-234, 2002.

J. Goldstine, H. Leung, and D. Wotschke, Measuring nondeterminism in pushdown automata, Journal of Computer and System Sciences, vol.71, issue.4, pp.440-466, 2005.

M. Harrison, Introduction to Formal Language Theory, 1978.

J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages, and Computation, 1979.

J. Hromkovic, S. Seibert, J. Karhumäki, H. Klauck, and G. Schnitger, Communication complexity method for measuring nondeterminism in finite automata. Information and Computation, vol.172, pp.202-217, 2002.

D. Kozen, Lower bounds for natural proof systems, Proceedings of the 18th Annual Symposium on Foundations of Computer Science, pp.254-266, 1977.

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

K. Mehlhorn, Pebbling mountain ranges and its application to DCFL-recognition, Proceedings of the 7th International Colloquium on Automata, Languages, and Programming, pp.422-435, 1980.

A. Okhotin and K. Salomaa, Complexity of input-driven pushdown automata, SIGACT News, vol.45, issue.2, pp.47-67, 2014.

A. Okhotin and K. Salomaa, Input-driven pushdown automata with limited nondeterminism, Proceedings of DLT'14, pp.84-102, 2014.

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, pp.245-264, 2012.

, Handbook of Formal Languages, vol.3, 1997.

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

A. Weber and H. Seidl, On the degree of ambiguity of finite automata, Theoretical Computer Science, vol.88, issue.2, pp.325-349, 1991.

D. Wood, Theory of Computation, 1986.