Regular Language and Finite Automata|| (1 Mark)||MCQ||2020

Last Updated :
Discuss
Comments

Which one of the following regular expressions represents the set of all binary strings with an odd number of 1’s?

[GATE 2020|| MCQ|| 1-mark]


10*(0*10*10*)*

((0 + 1)*1(0 + 1)*1)*10*

(0*10*10*)*10*

(0*10*10*)*0*1

This question is part of this quiz :

GATE||Regular Language and Finite Automata|| Pyq (2010 to2025),GATE||TOC || Pyq (2010 to2025)
Tags:
GATE CS
Theory of Computation
regular-expression
GATE CS
Share your thoughts in the comments
Article Tags :