 Sturmian word

An infinite binary word is Sturmian if it has exactly $n+1$ distinct contiguous subwords of length $n$ for every positive integer $n$.

A Sturmian word is a type of infinite sequence that is often studied in the fields of combinatorics and formal language theory.