Gate CS-2016-1 Question Paper With Solutions

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

Gate CS-2016-1 Question Paper With Solutions

Answer: (B)

Explanation:

Gate CS-2016-1 Question Paper With Solutions

Learn More:   Gate EE-2012 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here