1. Gabrielian, A.: Pure grammars and pure languages. University of Waterloo, Department of Applied Analysis and Computer Science Research Report CSRR 2027 (1970).
2. Ginsburg, S.: The mathematical theory of context-free languages. McGraw-Hill 1966.
3. Paz, A., Salomaa, A.: Integral sequential word functions and growth equivalence of Lindenmayer systems. Information and Control, to appear.
4. Rozenberg, G.: The equivalence problem for deterministicTOL-systems is undecidable. SUNY at Buffalo, Department of Computer Science Report 24-72 (1972).
5. Salomaa, A.: Formal languages. Academic Press, 1973, to appear.