Philippe Choquette

Learn More
Smooth infinite words over Σ = {1, 2} are connected to the Kolakoski word K = 221121 · · ·, defined as the fixpoint of the function ∆ that counts the length of the runs of 1's and 2's. In this paper we extend the notion of smooth words to arbitrary alphabets and study some of their com-binatorial properties. Using the run-length encoding ∆, every word is(More)
  • 1