2 problems

0 votes0 replies0 views
Conjecture on bounded reflection-complexity increments for sequences of at most linear factor complexity
Conjecture 28. The sequence
Conjectureopencombinatorics-on-words complexity-functions symbolic-dynamicsarXiv posted 2 days ago
0 votes0 replies0 views
Krawchuk–Rampersad conjecture on the cyclic complexity of the Thue–Morse word
Let $\mathbf{t}=01101001\cdots$ be the Thue–Morse word, and let $c_{\mathbf{t}}(n)$ denote the number of length- $n$ factors of $\mathbf{t}$ , counting factors that differ only by a…
Conjectureopencombinatorics-on-words complexity-functions thue-morse-wordarXiv posted 2 days ago

Conjecture on bounded reflection-complexity increments for sequences of at most linear factor complexity