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

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

  1. (0+1)∗0011(0+1)∗+(0+1)∗1100(0+1)∗(0+1)∗0011(0+1)∗+(0+1)∗1100(0+1)∗
  2. (0+1)∗(00(0+1)∗11+11(0+1)∗00)(0+1)∗(0+1)∗(00(0+1)∗11+11(0+1)∗00)(0+1)∗
  3. (0+1)∗00(0+1)∗+(0+1)∗11(0+1)∗(0+1)∗00(0+1)∗+(0+1)∗11(0+1)∗
  4. 00(0+1)∗11+11(0+1)∗00
1Comment
Sumit Verma @sumitkgp
17 Jul 2017 10:16 pm