Critical exponents of infinite balanced words
Theoretical Computer Science(2019)
摘要
Over an alphabet of size 3 we construct an infinite balanced word with critical exponent 2+2/2. Over an alphabet of size 4 we construct an infinite balanced word with critical exponent (5+5)/4. Over larger alphabets, we give some candidates for balanced words (found computationally) having small critical exponents. We also explore a method for proving these results using the automated theorem prover Walnut.
更多查看译文
关键词
Infinite word,Balanced word,Sturmian word,Critical exponent
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络