[1] J. Dassow: Remarks on the complexity of regulated rewriting. Fund. Inform. 7(1984), 83-103. MR 0745539 | Zbl 0546.68063

[2] S. Ginsburg: The Mathematical Theory of Context-free Languages. McGraw Hill, New York 1966. MR 0211815 | Zbl 0184.28401

[3] J. Gruska: On a classification of context-free languages. Kybernetika 3 (1967), 22-29. MR 0209092 | Zbl 0158.25401

[4] J. Gruska: Descriptional complexity of context-free languages. In: Proc. Symp. Math. Foundations of Computer Science '73, 71 - 83. MR 0405938

[5] O. Ibarra: Simple matrix languages. Inform. and Control 17 (1970), 359-394. MR 0274232 | Zbl 0221.68041

[6] O. Mayer: Some restrictive devices for context-free grammars. Inform. and Control 20 (1972), 69-92. MR 0359412 | Zbl 0248.68035

[7] Gh. Păun: Matrix Grammars. (in Romanian). The Scientific and Encyclopaedic Publ. House, Bucharest 1981.

[8] Gh. Păun: Six nonterminals are enough for generating a recursively enumerable language by a matrix grammar. Internat. J. Comput. Math. 75 (1984). MR 0745561

[9] A. Pirická-Kelemenová: Doctoral dissertation, Bratislava 1980.

[10] A. Salomaa: Formal Languages. Academic Press, New York 1973. MR 0438755 | Zbl 0262.68025

[11] A. P. J. van der Walt: Random context languages. Information Processing 1971, North-Holland, Amsterdam 1972, 66-68. MR 0400823