Which one of the following regular expressions represents the language: the set of all binary strings having two cosecutive 0s and two consecutive 1s?

Open in App

Solution

We wish to find regular expression "for all binary strings containing two consecutive 0's and two consecutive 1's".

Now, choice (a) cannot gennerate "001011" choice (b) is correct

Choice (c) can generate "00" which does not belong to given language.

Choice (d) always ends with 11 or 00 and hence cannot generate "001101"

Suggest Corrections

Similar questions

{ω ϵ (0 + 1)^{*} ∣ ω h a s e v e n n u m b e r o f 1 s}

(10)^{2}

Which of the following regular expressions describes the language over {0, 1}

consisting of string that contain exactly two 1's ?

Join BYJU'S Learning Program