1. C. Bader and A. Moura,A generalization of Ogden's lemma, J. ACM 29 (1982), 404–407.
2. M. Blattner and M. Latteux,Parikh-bounded languages, in:Lecture Notes in Computer Science 115, pp. 316–323, Springer-Verlag, (1982).
3. M. A. Harrison,Introduction to Formal Language Theory, Addison-Wesley, (1978).
4. M. Höpner,Über den Zusammenhang von Szilardsprachen und Matrixgrammatiken, Bericht Nr. 12, Institut für Informatik, Universität Hamburg, (1974).
5. S. Horvath,The family of languages satisfying Bar-Hillel's lemma, RAIRO Inf. Theor. 12 (1978), 193–199.