Question:-
Let L = {w Î (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 expressions below represents L?
Option (A)
(0*10*1 )*
Option (B)
0* (10*10*)*
Option(C)
0* (10*1*) *0*
Option(D)
0*1 (10*1) *10*
Correct Option:
(B)
Question Solution:
Every string should contain even number of ‘1’ s. min string are e , 0, 11, 101, 1010 ..... we get those string from the expression 0* (10* 10*)*
In option C and D Min. string is not e . In option A we don’t get, 0,00,000 ....
question-answer-faq-2243