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

Question

Examsnet · Accepted Answer

Correct Answer is : (0 + 1) *(00(0 + 1)*11 + 11 (0 + 1)*00) (0 + 1)*

GATE Computer Science (CS) 2016 Shift 1 Solved Paper