Nonterminals, homomorphisms and codings in different variations of OL- systems. I: Deterministic systems. (English) Zbl 0357.68094


68Q45 Formal languages and automata
Full Text: DOI


[1] ?ulik, K. II, Opatrny, J.: Literal homomorphisms of OL-languages. University of Waterloo, Research Report CS-73-25, 1973 · Zbl 0327.68071
[2] Ehrenfeucht, A., Rozenberg, G.: The equality of EOL-languages and codings of OL-languages. To appear in: International J. Computer Mathematics · Zbl 0314.68027
[3] Ehrenfeucht, A., Rozenberg, G.: Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems. Acta Informatica 3, 265-283 (1974) · Zbl 0313.68062 · doi:10.1007/BF00288638
[4] Herman, G., Rozenberg, G.: Developmental Systems and Languages. Amsterdam: North-Holland (to appear) · Zbl 0306.68045
[5] Lindenmayer, A., Rozenberg, G.: Developmental systems with locally catenative formulas. Acta Informatica 2, 214-248 (1973) · Zbl 0304.68076 · doi:10.1007/BF00289079
[6] Nielsen, M.: The decidability of some equivalence problems for DOL-systems. Information and Control 25, 166-193 (1974) · Zbl 0284.68065 · doi:10.1016/S0019-9958(74)90857-2
[7] Paz, A., Salomaa, A.: Integral sequential word functions and growth equivalence of Lindenmayer systems. Information and Control 23, 313-343 (1973) · Zbl 0273.68056 · doi:10.1016/S0019-9958(73)80002-6
[8] Salomaa, A.: Formal languages. London-New York: Academic Press 1973 · Zbl 0262.68025
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.