Which one of the following languages over the alphabet {0,1} is described by…

PYQ 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)* ?

  1. A.

    The set of all strings containing the substring 00.

  2. B.

    The set of all strings containing at most two 0’s.

  3. C.

    The set of all strings containing at least two 0’s.

  4. D.

    The set of all strings that begin and end with either 0 or 1.

Attempted by 403 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…