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
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s
<>
Submitted on : Tuesday, May 13, 2014 - 3:36:50 PM
Last modification on : Wednesday, November 29, 2017 - 10:26:18 AM
Document(s) archivé(s) le : Monday, April 10, 2017 - 10:14:45 PM
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⟩
