1. EATCS Monographs in Theoretical Computer Science;J Dassow,1989
2. Fernau, H., Freund, R., Oswald, M., Reinhardt, K.: Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars. J. Autom. Lang. Comb. 12(1/2), 117–138 (2007)
3. Lecture Notes in Computer Science;H Fernau,2018
4. Fernau, H., Kuppusamy, L., Oladele, R.O., Raman, I.: Improved descriptional complexity results for simple semi-conditional grammars. Fund. Inform. 181, 189–211 (2021)
5. Fernau, H., Kuppusamy, L., Oladele, R.O., Raman, I.: Improved descriptional complexity results on generalized forbidding grammars. Discret. Appl. Math. 319, 2–18 (2022)