The Maximal Number of Runs in Standard Sturmian Words

[摘要] We investigate some repetition problems for a very special class $\mathcal{S}$ of strings called the standard Sturmian words, which  have very compact representations in terms of sequences of integers. Usually the size of this word is exponential with res

[学科分类] 离散数学和组合数学

[关键词] combinatorics on words;repetitions;compression