×

zbMATH — the first resource for mathematics

On the decidability of homomorphism equivalence for languages. (English) Zbl 0389.68042

MSC:
68Q45 Formal languages and automata
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Culik, K., On the decidability of the sequence equivalence problem for DOL-systems, Theor. comput. sci., 3, 75-84, (1977) · Zbl 0352.68103
[2] Culik, K.; Fris, J., The decidability of the equivalence problem for DOL-systems, Inform. contr., 35, 20-39, (1977) · Zbl 0365.68074
[3] Nielsen, M., On the decidability of some equivalence problems for DOL-systems, Inform. contr., 25, 166-193, (1974) · Zbl 0284.68065
[4] Salomaa, A., Formal languages, (1973), Academic Press New York · Zbl 0262.68025
[5] Salomaa, A., On sentential forms of context-free grammars, Acta inform., 2, 40-49, (1973) · Zbl 0264.68029
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.