Ehrenfeucht, A.; Rozenberg, G. On the structure of derivations in deterministic ETOL systems. (English) Zbl 0388.68066 J. Comput. Syst. Sci. 17, 331-347 (1978). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 4 Documents MSC: 68Q45 Formal languages and automata × Cite Format Result Cite Review PDF Full Text: DOI References: [1] Downey, P., Developmental systems and recursion schems, (Proceedings of the Conference on Biologically Motivated Automata Theory (1974), McLean: McLean Virginia) [2] Ehrenfeucht, A.; Rozenberg, G., A pumping theorem for deterministic ET0L languages, Rev. Franraise Informat. Recherche Opérationnelle (1975) [3] Ehrenfeucht, A.; Rozenberg, G., On some Context-Free Languages That are Not Deterministic ETOL Languages, (Technical Report No. CU-CS-048 (1974), Department of Computer Science, University of Colorado at Boulder) · Zbl 0378.68040 [4] Ehrenfeucht, A.; Rozenberg, G.; Skyum, S., A relationship between ET0L and EDT0L languages, Theor. Computer Sci., 1, 325-330 (1976) · Zbl 0339.68055 [5] Herman, G. T.; Rozenberg, G., Developmental Systems and Languages (1975), North-Holland: North-Holland Amsterdam · Zbl 0313.68068 [6] Rozenberg, G., T0L systems and languages, Inform. Contr., 357-381 (1973) · Zbl 0273.68055 [7] G. RozenbergInternat. J. Comput. Information Sci.2; G. RozenbergInternat. J. Comput. Information Sci.2 [8] (Rozenberg, G.; Salomaa, A., L Systems. L Systems, Lecture Notes in Computer Science, No. 15 (1974), Springer-Verlag: Springer-Verlag New York/Berlin) [9] Rozenberg, G.; Salomaa, A., The mathematical theory of L systems, (Tou, J., Advances in Information Systems Science, Vol. 6 (1976)), 161-206 · Zbl 0365.68072 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.