Nevisi_Reidenbach_TCS_Unambiguous_1_Uniform_Morphisms.pdf (413.38 kB)
Unambiguous 1-uniform morphisms
journal contribution
posted on 2013-04-09, 11:04 authored by Hossein NevisiHossein Nevisi, Daniel ReidenbachA morphism σ is unambiguous with respect to a word α if there is no other morphism τ that maps α to the same image as σ. In the present paper we study the question of whether, for any given word, there exists an unambiguous 1-uniform morphism, i.e., a morphism that maps every letter in the word to an image of length 1.
History
School
- Science
Department
- Computer Science
Citation
NEVISI, H. and REIDENBACH, D., 2013. Unambiguous 1-uniform morphisms. Theoretical Computer Science, 478, pp.101-117.Publisher
© ElsevierVersion
- AM (Accepted Manuscript)
Publication date
2013Notes
NOTICE: this is the author’s version of a work that was accepted for publication in Theoretical Computer Science. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published at: http://dx.doi.org/10.1016/j.tcs.2012.11.023ISSN
0304-3975Publisher version
Language
- en
