OFFSET
1,1
COMMENTS
The subword complexity function rho_i (w) counts the distinct (contiguous) subwords of length i in the word w. The maximum complexity function is max_{1 <= i <= |w|} rho_i (w). For length-n words w of maximum complexity, it is known that the maximum is attained by counting subwords of length i+1 when 2^i + i <= n <= 2^{i+1} + i (sequence A103354).
LINKS
M-C. Anisiu, Z. Blazsik, Z. Kasa, Maximal Complexity of Finite Words, Pure Math. Appl., 13, 1-2 (2002) 39-48; arXiv:1002.2724 [cs.DM], 2010.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Jeffrey Shallit, Mar 05 2019
STATUS
approved