GATE Papers >> CSE >> 2009 >> Question No 15

Question No. 15 CSE | GATE 2009

Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)*?


Answer : (C) The set of all strings containing at least two 0’s.


Comments
No Comments
Leave a comment