Unambiguous 1-Uniform Morphisms

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.

In Petr Ambrož, Štěpán Holub and Zuzana Masáková: Proceedings 8th International Conference Words 2011 (WORDS 2011), Prague, Czech Republic, 12-16th September 2011, Electronic Proceedings in Theoretical Computer Science 63, pp. 158–167.
Published: 17th August 2011.

ArXived at: http://dx.doi.org/10.4204/EPTCS.63.22 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org