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

Question

TuteeHUB · Accepted Answer

None of the mentioned

TuteeHUB · Answer

String with substring 00

TuteeHUB · Answer

string with at most two 0‚Äö√Ñ√∂‚àö√ë‚àö¬•s

TuteeHUB · Answer

string containg at least two 0‚Äö√Ñ√∂‚àö√ë‚àö¬•s

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)*?
A.	String with substring 00
B.	string with at most two 0‚Äö√Ñ√∂‚àö√ë‚àö¬•s
C.	string containg at least two 0‚Äö√Ñ√∂‚àö√ë‚àö¬•s
D.	None of the mentioned
Answer» D. None of the mentioned

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