Ehrenfeucht, A.; Rozenberg, G. Elementary homomorphisms and a solution of the DOL sequence equivalence problem. (English) Zbl 0407.68085 Theor. Comput. Sci. 7, 169-183 (1978). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 5 ReviewsCited in 37 Documents MSC: 68Q45 Formal languages and automata 03B25 Decidability of theories and sets of sentences Keywords:Equivalence Problem; Elementary Language; Homomorphism; Recognition By Automata; Dol Systems; Decidability PDF BibTeX XML Cite \textit{A. Ehrenfeucht} and \textit{G. Rozenberg}, Theor. Comput. Sci. 7, 169--183 (1978; Zbl 0407.68085) Full Text: DOI References: [1] Culik, K.; Fris, I., The decidability of the equivalence problem for D0L systems, Information and control, 35, 20-39, (1977) · Zbl 0365.68074 [2] Ehrenfeucht, A.; Lee, K.P.; Rozenberg, G., Subword complexities of various classes of deterministic developmental languages without interactions, Theoret. comput. sci., 1, 59-76, (1974) · Zbl 0316.68043 [3] Ehrenfeucht, A.; Rozenberg, G., Simplifications of homomorphisms, Information and control, (1977) · Zbl 0414.68046 [4] Rozenberg, G.; Salomaa, A., The mathematical theory of L systems, (), 161-206 · Zbl 0365.68072 [5] Salomaa, A.; Soittola, M., Automata-theoretic aspects of formal power series, (1977), Springer Verlag Berlin 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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.