Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)*?
A)The set of all strings containing the substring 00.
B)The set of all strings containing at most two 0's.
C)The set of all strings containing at least two 0's.
D)The set of all strings that begin and end with either 0 or 1.

Question

Quizplus · Accepted Answer

The given regular expression (0+1)*0(0+1)*0(0+1)* describes the set of all strings that can have any combination of 0s and 1s but must contain at least two 0s in any position. The parts before, between, and after these two 0s can be any string, including the empty string, which is represented by the * operator applied to (0+1).

Which One of the Following Languages Over the Alphabet {0,1}