The set of all words of length n over alphabet $\{0,1\}$ with a fixed forbidden subword of length 4 is enumerated and constructed. The number of words is counted in two different ways, which gives some new combinatorial identities.