Noneffective Regularity of Equality Languages and Bounded Delay Morphisms

Tietueen suppeat tiedot
dc.contributor.authorJuhani Karhumäki
dc.contributor.authorAleksi Saarela
dc.contributor.organizationfi=matematiikka|en=Mathematics|
dc.contributor.organization-code1.2.246.10.2458963.20.41687507875
dc.converis.publication-id2078696
dc.converis.urlhttps://research.utu.fi/converis/portal/Publication/2078696
dc.date.accessioned2022-10-28T13:24:05Z
dc.date.available2022-10-28T13:24:05Z
dc.description.abstractWe 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.
dc.format.pagerange17
dc.format.pagerange9
dc.identifier.jour-issn1462-7264
dc.identifier.olddbid181821
dc.identifier.oldhandle10024/164915
dc.identifier.urihttps://www.utupub.fi/handle/11111/54162
dc.identifier.urlhttp://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1451
dc.identifier.urnURN:NBN:fi-fe2021042714452
dc.language.isoen
dc.okm.affiliatedauthorSaarela, Aleksi
dc.okm.affiliatedauthorKarhumäki, Juhani
dc.okm.discipline111 Mathematicsen_GB
dc.okm.discipline111 Matematiikkafi_FI
dc.okm.internationalcopublicationnot an international co-publication
dc.okm.internationalityInternational publication
dc.okm.typeA1 ScientificArticle
dc.publisherDISCRETE MATHEMATICS THEORETICAL COMPUTER SCIENCE
dc.publisher.countryUnited Kingdomen_GB
dc.publisher.countryBritanniafi_FI
dc.publisher.country-codeGB
dc.relation.ispartofjournalDiscrete Mathematics and Theoretical Computer Science
dc.relation.issue4
dc.relation.volume12
dc.source.identifierhttps://www.utupub.fi/handle/10024/164915
dc.titleNoneffective Regularity of Equality Languages and Bounded Delay Morphisms
dc.year.issued2010

Tiedostot

Näytetään 1 - 1 / 1
Name:
kasa10dmtcs.pdf
Size:
254.4 KB
Format:
Adobe Portable Document Format
Lataa

Kokoelmat

Rinnakkaistallenteet