There are k-uniform cubefree binary morphisms for all k >= 0

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/226703A word is cubefree if it contains no non-empty subword of the form xxx. A morphism h : Sigma^* -> Sigma^* is k-uniform if h(a) has length k for all a in Sigma. A morphism is cubefree if it maps cubefree words to cubefree words. We show that for all k >= 0 there exists a k-uniform cubefree binary morphism.5 pagesCombinatoricsFormal Languages and Automata Theory68R15There are k-uniform cubefree binary morphisms for all k >= 0text