B. Alspach, P. Eades, and G. Rose, A Lower-bound for the Number of Productions Required for a Certain Class of Languages, Discrete Appl. Math, vol.6, pp.109-115, 1983.

N. Blum and R. Koch, Greibach Normal Form Transformation Revisited, Inform. Comput, vol.150, issue.1, pp.112-118, 1999.
DOI : 10.1006/inco.1998.2772
URL : https://doi.org/10.1006/inco.1998.2772

W. Bucher, A Note on a Problem in the Theory of Grammatical Complexity, Theoret. Comput. Sci, vol.14, issue.3, pp.337-344, 1981.

W. Bucher, H. A. Maurer, K. Culik, and . Ii, Context-free Complexity of Finite Languages, Theoret. Comput. Sci, vol.28, issue.3, pp.277-285, 1983.
DOI : 10.1016/0304-3975(83)90024-5
URL : https://doi.org/10.1016/0304-3975(83)90024-5

W. Bucher, H. A. Maurer, K. Culik, I. I. , and D. Wotschke, Concise Description of Finite Languages, Theoret. Comput. Sci, vol.14, issue.3, pp.227-246, 1981.
DOI : 10.1016/0304-3975(81)90044-x
URL : https://doi.org/10.1016/0304-3975(81)90044-x

C. Câmpeanu, N. Sântean, and S. Yu, Minimal cover-automata for finite languages, Theoret. Comput. Sci, vol.267, issue.1-2, pp.3-16, 2001.

J. Dassow and G. , Regulated Rewriting in Formal Language Theory, vol.18, 1989.
DOI : 10.1007/978-3-642-74932-2

S. Eberhard and S. Hetzl, On the compressibility of finite languages and formal proofs, Inform. Comput, vol.259, issue.2, pp.191-213, 2018.

S. Hetzl and S. Wolfsteiner, Cover Complexity of Finite Languages, Proc. 20th DCFS, 2018.
DOI : 10.1007/978-3-319-94631-3_12
URL : https://hal.archives-ouvertes.fr/hal-01905625

H. Gruber, M. Holzer, and S. Wolfsteiner, On Minimal Grammar Problems for Finite Languages, 2018.
DOI : 10.1007/978-3-319-98654-8_28

D. Wood, Theory of Computation, 1987.