GATE CS 2010 — Question 35

Multiple choice 2 marks Question 35 2010

Question 35

MCQ 2 marks · −0.66 Theory of Computation

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

Answers and explanations are free — they just need an account.

Where this question comes from

GATE CS — Computer Science & IT 2010 Theory of Computation

Source: GATE 2010 Computer Science and Engineering, Q35 (question number approximate)

All Theory of Computation questions