Let L = { w in (0 + 1)* | w has an even number of 1s }. That is, L is the set…
GATE · 2010 · CS · Computer Science & IT
Let L = { w in (0 + 1)* | w has an even number of 1s }. That is, L is the set of all bit strings with an even number of 1s. Which one of the following regular expressions represents L?
- A.
(0*10*1)*
- B.
0*(10*10*)*
- C.
0*(10*1)*0*
- D.
0*+(10*1)*10*
Attempted by 223 students.
Sign up free to check your answer
Sign up freeLoading lesson…