Obtain a regular expression such that L(R) = {w | w ∈ {0, 1}* with at least three consecutive 0’s.

A string consisting of 0’s and l’s can be represented by the regular expression

(0 + 1)*

This arbitrary string can precede three consecutive zeros and can follow three consecutive zeros.

Therefore the regular expression can be written as

(0 +1)* 000(0+1)*.

The language corresponding to the regular expression can be written as