Binary sequences without $0\undersetbrace{k-1}\to{11\dots11}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\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.

Downloads

Published

1994-10-15

Issue

Vol. 46 No. 3–4 (1994): Vol. 46, Issue 3–4

Section

Articles

License

Copyright (c) 1994 Authors retain copyright to their work.

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.