Question

Let $L_1$ be the language corresponding to the regular expression $(0+1{)}^{\ast }{001}^{\ast }and{L}_2$ be the language correponding to the regular expression 110(1+0)*. Which of the following is the regular expression corresponding to the language $L_1\cap L_2$?

• A. $(0+1{)}^{\ast }00110(1-10{)}^{\ast }$
• B. None of the above
• C. (0+1)*0001*
• D. 110001*

Answer 1

The correct option is B None of the above

None of the option accepts 1100.