Binary Sequences Without 01k-10 for Fixed k


Rade Doroslovački


The paper gives a special construction of those words (binary sequences) of length $n$ over alphabet $\{0,1\}$ in which the subword $0\undersetbrace{k-1}\to{11\dots11}0$ is forbidden for some natural number~$k$. This number of words is counted in two different ways, which gives some new combinatorial identities.