Unambiguous 1 - uniform morphisms
conference contributionposted on 13.10.2011 by Hossein Nevisi, Daniel Reidenbach
Any type of content contributed to an academic conference, such as papers, presentations, lectures or proceedings.
A morphism s is unambiguous with respect to a word a if there is no other morphism t that maps a to the same image as s . 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.
- Computer Science