Q. 51 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 being and end with either 0 or 1
Answer: (C)
Explanation:
