Abstract : 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.
https://hal.inria.fr/hal-00990433
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s
<>
Soumis le : mardi 13 mai 2014 - 15:36:50
Dernière modification le : mercredi 29 novembre 2017 - 10:26:18
Document(s) archivé(s) le : lundi 10 avril 2017 - 22:14:45
Juhani Karhumaki, Aleksi Saarela. Noneffective Regularity of Equality Languages and Bounded Delay Morphisms. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2010, 12 (4), pp.9-17. 〈hal-00990433〉
