Computer Sciences > Gate 2020 > Regular Language
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
None

Correct : d

Similar Questions

Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive 0s and two consecutive 1s?
#132 MCQ
Let L1 and L2 be any context-free language and R be any regular language. Then, which of the following is correct ? I. L1 ∪ L2 is context-free. II. L1' is cont...
#166 MCQ
For Σ = {a, b}, let us consider the regular language L = {x ∣ x = a2+ 3k or x = b10 + 12k, k ≥ 0} Which one of the following can be a pumping length (the co...
#252 MCQ

Related Topics

regular expressions odd number of 1's binary strings with odd 1s GATE computer science 2020 computer science gate regex odd ones binary string regex find odd 1s in binary none option for odd 1s

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: