[Solved] 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)*?

Computer Science Engineering (CSE)
Theory of Computation
Unit 1
Which one of the following languages ove...

Q.	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)*?
A.	The set of all strings containing the substring 00.
B.	The set of all strings containing at most two 0’s.
C.	The set of all strings containing at least two 0’s.
D.	The set of all strings that begin and end with either 0 or 1.
Answer» C. The set of all strings containing at least two 0’s.

View all MCQs in: Theory of Computation

Discussion

Related Questions

Let P be a regular language and Q be context-free language such that Q ∈ P. (For example, let P be the language represented by the regular expression p*q* and Q be {pnqn n∈ N}). Then which of the following is ALWAYS regular?
A language is represented by a regular expression (a)*(a + ba). Which of the following strings does not belong to the regular set represented by the above expression?
Consider the following statements I. Recursive languages are closed under complementation II. Recursively enumerable languages are closed under union III. Recursively enumerable languages are closed under complementation Which of the above statement are TRUE?
Which of the following statements is/are FALSE? (1) For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine. (2) Turing recognizable languages are closed under union and complementation. (3) Turing decidable languages are closed under intersection and complementation (4) Turing recognizable languages are closed under union and intersection.
The languages -------------- are the examples of non regular languages.
Languages are proved to be regular or non regular using pumping lemma.
Let L be any infinite regular language, defined over an alphabet Σ then there exist three strings x, y and z belonging to Σ such that all the strings of the form XY^ n Z for n=1,2,3, … are the words in L called
How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*?
Let L be a language defined over an alphabet ∑,then the language of strings , defined over ∑, not belonging to L denoted by LC or L. is called :
If L1 and L2 are context free language and R a regular set, then which one of the languages below is not necessarily a context free language?