Counting Lyndon Factors

[摘要] In this paper, we determine the maximum number of distinct Lyndon factors that a word of length $n$ can contain. We also derive formulas for the expected total number of Lyndon factors in a word of length $n$ on an alphabet of size $\sigma$, as well as th

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

[关键词] Lyndon word;Sturmian word;Fibonacci word;Christoffel word