3 votes 3 votes Consider the following languages: The language of regular expression $(0+1)^{\ast } 11(0+1)^{\ast }$ The language of regular expression $\left(0^{\ast } 1^{\ast } 11\right)^{\ast } 0^{\ast } 110^{\ast } 1^{\ast }$ Which of the following is true? $1$ is a proper subset of $2$ $2$ is a proper subset of $1$ $1=2$ Neither $1$ is subset of $2$, nor $2$ is subset of $1$. Theory of Computation goclasses2024-toc-1-weekly-quiz goclasses theory-of-computation regular-expression 2-marks + – GO Classes asked Jun 9, 2022 • retagged Jun 17, 2023 by Lakshman Bhaiya GO Classes 259 views answer comment Share Follow See 1 comment See all 1 1 comment reply JAINchiNMay commented Nov 16, 2022 reply Follow Share Take string 1011 ,It is not present in 2 2 votes 2 votes Please log in or register to add a comment.
2 votes 2 votes $1$ contains $2.\; 1$ is all strings of $0 's$ and $1's$ with two consecutive $1's.\; 2$ misses some of these strings, e.g., something ending with $110101 .$ GO Classes answered Jun 9, 2022 GO Classes comment Share Follow See 1 comment See all 1 1 comment reply Kabir5454 commented Nov 26, 2022 reply Follow Share $L2=\left ( 0^{*} 1^{*}11\right )^{*}0^{*}110^{*}1^{*}$ $\left ( 0^{*} 1^{*}11\right )^{*}0^{*}\subset \left ( 1+0 \right )^{*}$ $0^{^{*}}1^{*}\subset \left ( 1+0 \right )^{*}$ So $L2\subset L1$ 0 votes 0 votes Please log in or register to add a comment.
