Binary sequences without $0\undersetbrace{k-1}\to{11\dots11}0$ for fixed $k$

Rade Doroslovački

Binary sequences without $0 \undersetbrace k - 1 \to 11 \dots 11 0$ for fixed $k$

Authors

Rade Doroslovački Department of Mathematics, Faculty of Engineering, University of Novi Sad, 21000 Novi Sad, Trg Dositeja Obradovića 6, Yugoslavia Author

Keywords:

Subword

Subjects:

05A15

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 \dots 11 0$ is forbidden for some natural number~ $k$ . This number of words is counted in two different ways, which gives some new combinatorial identities.