2008/05/09 by Brendan Lucier, Lucier, Brendan
Biochemistry, Genetics and Molecular Biology · Computer Science · #Cellular Automata and Applications #DNA and Biological Computing #Discrete Mathematics (cs.DM) #F.4.3 #FOS: Computer and information sciences #cs.DM #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.0805.1373
2 pages, working paper
arxiv created 2008/05/09 · openalex publication_date 2008/05/09 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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).