Events

Date: 16 February 2026   Time: 12:00 - 13:00

Location: MB-503

Smooth words over an alphabet of integers
{a,b} are infinite words that are infinitely derivable, the most famous
example being the Oldenburger-Kolakoski word over {1,2}. We study here the factor complexity of these words: we first show bounds for the complexity of f-smooth words, a language that is crucially connected to smooth words; we then show that smooth words are uniformly recurrent and have linear complexity when a and b have same parity.