Unambiguous 1-Uniform Morphisms

Computer Science – Formal Languages and Automata Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-180631

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.