1 problem

Let $r\geqslant 2$ and let $n$ be the length of a word over a two-letter alphabet. An $r$-regular word is a word satisfying the corresponding regularity condition, and…