1. Alspach, B., Eades, P., Rose, G.: A lower-bound for the number of productions required for a certain class of languages. Discrete Appl. Math. 6, 109–115 (1983)
2. Bucher, W.: A note on a problem in the theory of grammatical complexity. Theoret. Comput. Sci. 14(3), 337–344 (1981)
3. Bucher, W., Maurer, H.A., Culik II, K.: Context-free complexity of finite languages. Theoret. Comput. Sci. 28(3), 277–285 (1983)
4. Bucher, W., Maurer, H.A., Culik II, K., Wotschke, D.: Concise description of finite languages. Theoret. Comput. Sci. 14(3), 227–246 (1981)
5. Casel, K., Fernau, H., Gaspers, S., Gras, B., Schmid, M.L.: On the complexity of grammar-based compression over fixed alphabets. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, volume 55 of LIPIcs, Rome, Italy, pp. 122:1–122:14. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany (2016)