Unambiguous 1-Uniform Morphisms 英文论文文献.docVIP

Unambiguous 1-Uniform Morphisms Hossein Nevisi? Daniel Reidenbach Department of Computer Science Loughborough University Loughborough, LE11 3TU, United Kingdom H.Nevisi@lboro.ac.uk D.Reidenbach@lboro.ac.uk 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. 1 Introduction If, for a morphism σ : ??→ Σ? (where ? and Σ ar