Noneffective Regularity of Equality Languages and Bounded Delay Morphisms

Juhani Karhumaki; Aleksi Saarela

doi:10.46298/dmtcs.523

Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2010

Noneffective Regularity of Equality Languages and Bounded Delay Morphisms

(1) , (1)

Juhani Karhumaki

Function : Author

Turku Centre for Computer Science

Aleksi Saarela

Function : Author

Turku Centre for Computer Science

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.

Keywords

regularity bounded delay Post correspondence problem

Domains

Discrete Mathematics [cs.DM]

Fichier principal

1451-5150-1-PB.pdf (233.17 Ko)

Origin	Files produced by the author(s)

Service Ist Inria Sophia Antipolis-Méditerranée / I3s : Connect in order to contact the contributor

https://inria.hal.science/hal-00990433

Submitted on : Tuesday, May 13, 2014-3:36:50 PM

Last modification on : Tuesday, February 7, 2023-3:42:45 AM

Long-term archiving on : Monday, April 10, 2017-10:14:45 PM

Dates and versions

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

Identifiers

HAL Id : hal-00990433 , version 1
DOI : 10.46298/dmtcs.523

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

TDS-MACS

45 View

851 Download

Noneffective Regularity of Equality Languages and Bounded Delay Morphisms

Abstract

Keywords

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share