pith. sign in

arxiv: 0805.1373 · v1 · submitted 2008-05-09 · 💻 cs.DM

Binary Morphisms to Ultimately Periodic Words

classification 💻 cs.DM
keywords periodicultimatelybinarymorphismswordwordsclassifiescommutes
0
0 comments X
read the original abstract

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).

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.