|
Hossein Nevisi (Loughborough University) |
Daniel Reidenbach (Loughborough University) |
| A morphism h is unambiguous with respect to a word w if there is no other morphism g that maps w to the same image as h. 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. |
| ArXived at: http://dx.doi.org/10.4204/EPTCS.63.22 | bibtex |
Comments and questions to:
eptcs@eptcs.org
|
For website issues:
webmaster@eptcs.org
|