A regular expression question

Question

Hello, I am in dire need of a such regular expression where my alphabet is made up of 0s and 1s.

Now I need a language that accepts all words as long as it has three 0s.

IE:

000 10001 0001 1000 10000101

Answer 1

Three consecutive zero chars:

\b[01]*0{3}[01]*\b

Note
It is not entirely clear whether this is what OP wants.

Edit
Apparently it was :)

Answer 2

\b(1*0){3}

will also match if the three zeros are not consecutive.

This only matches as much as required (i.e. up until the third zero). If you want it to match the entire number, use

\b(1*0){3}[01]*\b

Answer 3

You mean a number that can be divided by 3 zeros, such as 3, 6, 9? or 3 more or zeros?