The analogue of overlap-freeness for the Fibonacci morphism.
CoRR(2023)
摘要
A $4^-$-power is a non-empty word of the form $XXXX^-$, where $X^-$ is
obtained from $X$ by erasing the last letter. A binary word is called {\em
faux-bonacci} if it contains no $4^-$-powers, and no factor 11. We show that
faux-bonacci words bear the same relationship to the Fibonacci morphism that
overlap-free words bear to the Thue-Morse morphism. We prove the analogue of
Fife's Theorem for faux-bonacci words, and characterize the lexicographically
least and greatest infinite faux-bonacci words.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要