Which one of the following regular expressions represents the language: the…

PYQ GATE 2016

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

  1. A.

    ((0 + 1)*0011(0 + 1)* + (0 + 1)*1100(0 + 1)*)

  2. B.

    ((0 + 1)*(00(0 + 1)*11 + 11(0 + 1)*00)(0 + 1)*)

  3. C.

    ((0 + 1)*00(0 + 1)* + (0 + 1)*11(0 + 1)*)

  4. D.

    (00(0 + 1)*11 + 11(0 + 1)*00)

Attempted by 270 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…