Which one of the following regular expressions represents the set of all binary strings with an odd number of 1's?
- (A)
((0 + 1)*1(0 + 1)*1)10
- (B)
(0*10*10*)*0*1
- (C)
10*(0*10*10*)*
- (D)
(0*10*10*)10
GATE 2020 CS Q.7: official answer
Official answer
Official answer: marks to all candidatesSource: Official answer key, GATE 2020 CS (IIT Delhi)
From the GATE 2020 CS paper. Every question of this paper · Download the full paper · All 18 Finite automata questions, with notes
More Finite automata questions
- GATE 2018 CS Q.6 · MCQ · 1 markLet N be an NFA with n states. Let k be the number of states of a minimal DFA which is equivalent to N.
- GATE 2018 CS Q.52 · NAT · 2 marksGiven a language L, define L^i as follows: L^0 = ε L^i = L^i-1 · L for all i > 0 The order of a language L…
- GATE 2026 CS1 Q.26 · MSQ · 1 markLet M be a nondeterministic finite automaton (NFA) with 6 states over a finite alphabet.
- GATE 2026 CS2 Q.47 · MSQ · 2 marksConsider the following two finite automata D_1 and D_2. Which of the following statements is/are true?