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

Simple item page
dc.creatorCurrie, James
dc.creatorRampersad, Narad
dc.date2008-12-24
dc.date.accessioned2026-07-07T13:03:10Z
dc.date.available2026-07-07T13:03:10Z
dc.descriptionA 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.
dc.description5 pages
dc.identifierhttps://arxiv.org/abs/0812.4470
dc.identifierhttp://arxiv.org/abs/0812.4470
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/226703
dc.subjectCombinatorics
dc.subjectFormal Languages and Automata Theory
dc.subject68R15
dc.titleThere are k-uniform cubefree binary morphisms for all k >= 0
dc.typetext

Files

Collections

arXiv