Computer Science – Formal Languages and Automata Theory
Scientific paper
2011-08-18
EPTCS 63, 2011, pp. 158-167
Computer Science
Formal Languages and Automata Theory
In Proceedings WORDS 2011, arXiv:1108.3412
Scientific paper
10.4204/EPTCS.63.22
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.
Nevisi Hossein
Reidenbach Daniel
No associations
LandOfFree
Unambiguous 1-Uniform Morphisms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Unambiguous 1-Uniform Morphisms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unambiguous 1-Uniform Morphisms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-180631