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

strings beginning and ending with either 0 or 1

TuteeHUB · Answer

strings with the substring 00

TuteeHUB · Answer

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

TuteeHUB · Answer

strings with 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.	strings with the substring 00
B.	strings with at most two 0‚Äö√Ñ√∂‚àö√ë‚àö¬•s
C.	strings with at least two 0‚Äö√Ñ√∂‚àö√ë‚àö¬•s
D.	strings beginning and ending with either 0 or 1
Answer» D. strings beginning and ending with either 0 or 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)*?