An Inequality For The Number Of Periods In A Word
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE(2021)
摘要
We prove an inequality for the number of periods in a word x in terms of the length of x and its initial critical exponent. Next, we characterize all periods of the length-n prefix of a characteristic Sturmian word in terms of the lazy Ostrowski representation of n, and use this result to show that our inequality is tight for infinitely many words x. We propose two related measures of periodicity for infinite words. Finally, we also consider special cases where x is overlap-free or squarefree.
更多查看译文
关键词
Periods of a word, borders, characteristic Sturmian word, periodicity, initial critical exponent, lazy Ostrowski representation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要