We give an instance of a class of morphisms for which it is easy to prove that their equality set is regular, but its emptiness is still undecidable. The class is that of bounded delay 2 morphisms.
Source: OpenCitations
Reachability via Cooperating Morphisms
Electronic Notes in Theoretical Computer Science
Journal reference : Volume 223, 2008, pp. 15-27
DOI : 10.1016/j.entcs.2008.12.028