Unambiguous 1-uniform morphisms
journal contributionposted on 2013-04-09, 11:04 authored by Hossein NevisiHossein Nevisi, Daniel Reidenbach
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.
- Computer Science