A1 Refereed original research article in a scientific journal

Noneffective Regularity of Equality Languages and Bounded Delay Morphisms



Authors: Juhani Karhumäki, Aleksi Saarela

Publisher: DISCRETE MATHEMATICS THEORETICAL COMPUTER SCIENCE

Publication year: 2010

Journal: Discrete Mathematics and Theoretical Computer Science

Journal name in source: DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE

Journal acronym: DISCRETE MATH THEOR

Number in series: 4

Volume: 12

Issue: 4

First page : 9

Last page: 17

Number of pages: 9

ISSN: 1462-7264

Web address : http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1451


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.


Research Areas

Downloadable publication

This is an electronic reprint of the original article.
This reprint may differ from the original in pagination and typographic detail. Please cite the original version.


Last updated on 2024-26-11 at 14:25