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 ?
Correct : d
Similar Questions
Consider the language L given by the regular expression (a + b)*b(a +b) over the alphabet {a, b}. The smallest number of states needed in a deterministic finite...
Consider the language L given by the regular expression (a + b)*b(a +b) over the alphabet {a, b}. The smallest number of states needed in a deterministic finite...
Consider the language L given by the regular expression (a + b)*b(a +b) over the alphabet {a, b}. The smallest number of states needed in a deterministic finite...
Total Unique Visitors
Loading......