Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
434727 | Theoretical Computer Science | 2013 | 17 Pages |
Abstract
A 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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics