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 expression below represents L?
A)(0*10*1)*
B)0*(10*10*)*
C)0*(10*1*)*0*
D)0*1(10*1)*10*

Question

Quizplus · Accepted Answer

Option B correctly represents the set L because it allows for any number of 0s at the beginning, followed by pairs of 1s (each possibly separated by any number of 0s), ensuring an even number of 1s in total.

Let L={w (0 + 1)* W Has Even Number of 1s}