Unambiguous 1-uniform morphisms

Authors:
Hossein Nevisi;Daniel Reidenbach
Affiliations:
-;-
Venue:
Theoretical Computer Science
Year:
2013

Citing 7
Cited 0

Morphisms

Handbook of formal languages, vol. 1
On a conjecture about finite fixed points of morphisms

Theoretical Computer Science - Combinatorics on words
Discontinuities in pattern inference

Theoretical Computer Science
Morphically primitive words

Theoretical Computer Science
The unambiguity of segmented morphisms

Discrete Applied Mathematics
Restricted ambiguity of erasing morphisms

Theoretical Computer Science
Weakly unambiguous morphisms

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

A morphism @s is unambiguous with respect to a word @a if there is no other morphism @t that maps @a to the same image as @s. 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.