There are k-uniform cubefree binary morphisms for all k >= 0
Combinatorics
2009-04-14 v1 Formal Languages and Automata Theory
Abstract
A 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.
Cite
@article{arxiv.0812.4470,
title = {There are k-uniform cubefree binary morphisms for all k >= 0},
author = {James Currie and Narad Rampersad},
journal= {arXiv preprint arXiv:0812.4470},
year = {2009}
}
Comments
5 pages