Test sets and checking words for homomorphism equivalence. (English) Zbl 0451.68046


68Q45 Formal languages and automata
Full Text: DOI


[1] Culik, K., A purely homomorphic characterization of recursively enumerable sets, J. Assoc. Comput. Mach., 26, 345-350 (1979) · Zbl 0395.68076
[2] Culik, K.; Fris, I., The decidability of the equivalence problem for DOL-systems, Inform. Contr., 35, 20-39 (1977) · Zbl 0365.68074
[3] Culik, K.; Maurer, H. A., On simple representation of language families, R.A.I.R.O., 13, 241-250 (1979) · Zbl 0432.68052
[4] Culik, K.; Richier, J. L., Homomorphism equivalence on ETOL languages, Internat. J. Computer Math., Sect. A, 7, 43-51 (1979) · Zbl 0401.68049
[5] Culik, K.; Salomaa, A., On the decidability of homomorphism equivalence for languages, J. Comput. System Sci., 17, 163-175 (1978) · Zbl 0389.68042
[6] Ehrenfeucht, A.; Rozenberg, G., Elementary homomorphisms and a solution of the DOL sequence equivalence problem, Theoret. Comput. Sci., 7, 169-183 (1978) · Zbl 0407.68085
[7] Harrison, M. A., Introduction to Formal Languages (1978), Addison-Wesley: Addison-Wesley Reading, Mass
[8] Rozenberg, G.; Salomaa, A., The Mathematical Theory of \(L\) systems (1980), Academic Press: Academic Press New York/London · Zbl 0365.68072
[9] Salomaa, A., Formal Languages (1973), Academic Press: Academic Press New York/London · 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.