Theory of Computation and Compiler Design MCQ: 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)*? | Extra Education

← All Theory of Computation and Compiler Design questions

1

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

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

Make the most of this question

This page focuses on one Theory of Computation and Compiler Design question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Theory of Computation and Compiler Design MCQs All Engineering topics Mock test hub

WhatsApp+91 99922 70404Theory of Computation and Compiler Design MCQ: 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)*? | Extra Education