The GATE Grind

GATE 2009 CS – Question 15

Theory of Computation · Regular Expressions and Finite Automata · 1 mark · Multiple choice

Which language over {0, 1} is described by $(0+1)^*0(0+1)^*0(0+1)^*$?

  1. All strings containing the substring 00.
  2. All strings containing at most two 0s.
  3. All strings containing at least two 0s.
  4. All strings that begin and end with either 0 or 1.

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (C) All strings containing at least two 0s.

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Regular Expressions and Finite Automata questions

All Regular Expressions and Finite Automata questions →