  In this paper we propose an algorithm to generate binary words with no more
0's than 1's having a fixed number of 1's and avoiding the pattern $(10)^j1$
for any fixed $j \geq 1$. We will prove that this generation is exhaustive,
that is, all such binary words are generated.
