GATE | GATE CS 2010 | Question 39

Let L={w \in (0 + 1)*|w has even number of 1s}, i.e. L is the set of all bit strings with even number of 1s. Which one of the regular expression below represents L?

(A) (0*10*1)*
(B) 0*(10*10*)*
(C) 0*(10*1*)*0*
(D) 0*1(10*1)*10*


Answer: (B)

Explanation: Option (A) is incorrect because it cannot accept “110″
Option (C) is incorrect because it accept a string with single 1.
Option (D) is incorrect because it cannot accept 11101

Quiz of this Question



My Personal Notes arrow_drop_up


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.