1. 1. BRAINERD B., An Analog of a Theorem About Context-Free Languages, Inform. Control, Vol. 11, 1968, pp. 561-568.2294880184.02601
2. 2. CIOBOTARU S., The Parallel Matrix Grammars and the Thue Languages, Bull. Math. Soc. Sc. Math. R.S.R., Vol. 27, (70), 1978, pp. 269-278.5085660385.68057
3. 3. CREMERS A. B., MAYÈR O. and WEISS K., On the Complexity of Regulated Context-Free Rewriting, Intern. Bericht, No. 4, Univ. Karlsruhe, Facilität für Informatik, 1973.0278.68077345454
4. 4. EHRENFEUCHT A. and ROZENBERG G., On Some Context-Free Languages that Are Not Deterministic ETOL Languages, R.A.I.R.O./Theoretical Computer Sc, Vol.11, No. 4, 1977, pp. 273-291.920564837460378.68040
5. 5. GINSBURG S., Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holl. Publ. Comp., Amsterdam, Oxford, 1975.4434460325.68002