| Binary sequences without $0\undersetbrace{k-1}\to{11\dots11}0$ for fixed $k$ |
| Rade Doroslovački |
Abstract 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.
|
Keywords: Subword. |
MSC: 05A15 |
Pages: 93--98 |
Volume 46 , Issue 3$-$4 , 1994 |
