The complexity of smooth words over binary alphabets

Julien Cassaigne, Raphaël Henry

Smooth sequences over an alphabet of positive integers $\{a,b\}$ are sequences that are infinitely derivable, the emblematic example being the Oldenburger-Kolakoski sequence $\kappa$ ov…