Q15

MCQ1 mark, −0.33

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 $\text{00}$

(B)

The set of all strings containing at most two $\text{0}$ 's

(C)

The set of all strings containing at least two $\text{0}$ 's

(D)

The set of all strings that begin and end with either $\text{0}$ or $\text{1}$

Loading…