Noneffective Regularity of Equality Languages and Bounded Delay Morphisms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2010

Noneffective Regularity of Equality Languages and Bounded Delay Morphisms

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.
Fichier principal
Vignette du fichier
1451-5150-1-PB.pdf (233.17 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00990433 , version 1 (13-05-2014)

Identifiers

Cite

Juhani Karhumaki, Aleksi Saarela. Noneffective Regularity of Equality Languages and Bounded Delay Morphisms. Discrete Mathematics and Theoretical Computer Science, 2010, Vol. 12 no. 4 (4), pp.9-17. ⟨10.46298/dmtcs.523⟩. ⟨hal-00990433⟩

Collections

TDS-MACS
35 View
631 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More