Binary Patterns in Binary Words

We strengthen the description of the 2-avoidable binary patterns given in J. Cassaigne [3], P. Roth [7], and Vanicek [8], by showing that every 2-avoidable binary pattern [t] can be avoided by an infinite independent set of binary words, and, the number of binary words avoiding [t] grows exponentially with their length.