The complexity of smooth words over binary alphabets

Julien Cassaigne, Raphaël Henry

Smooth words over an alphabet of non-negative integers $\{a,b\}$ are infinite words that are infinitely derivable, the emblematic example being the Oldenburger-Kolakoski word over…