Computer Science – Discrete Mathematics
Scientific paper
2008-05-09
Computer Science
Discrete Mathematics
2 pages, working paper
Scientific paper
This paper classifies binary morphisms that map to ultimately periodic words.
In particular, if a morphism h maps an infinite non-ultimately periodic word to
an ultimately periodic word then it must be true that h(0) commutes with h(1).
No associations
LandOfFree
Binary Morphisms to Ultimately Periodic Words 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 Binary Morphisms to Ultimately Periodic Words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Binary Morphisms to Ultimately Periodic Words will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-332617