×

Elementary homomorphisms and a solution of the DOL sequence equivalence problem. (English) Zbl 0407.68085


MSC:

68Q45 Formal languages and automata
03B25 Decidability of theories and sets of sentences
PDFBibTeX XMLCite
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, (Tou, J., Advances in Information Systems Science, Vol. 6 (1974), Plenum Press: Plenum Press New York), 161-206 · Zbl 0365.68072
[5] Salomaa, A.; Soittola, M., Automata-Theoretic Aspects of Formal Power Series (1977), Springer Verlag: 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. 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.