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 the proper subset of $1$ $1=2$ Neither $1$ is a subset of $2$, nor $2$ is a subset of $1.$ Theory of Computation goclasses2024-toc-2-weekly-quiz goclasses theory-of-computation regular-expression 2-marks + – GO Classes asked Jun 22, 2022 retagged Jun 17, 2023 by Lakshman Bhaiya GO Classes 186 views answer comment Share Follow See 1 comment See all 1 1 comment reply JAINchiNMay commented Nov 18, 2022 reply Follow Share 1011 string can not be generated by 2 0 votes 0 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 22, 2022 edited Jun 22, 2022 by Lakshman Bhaiya GO Classes comment Share Follow See all 0 reply Please log in or register to add a comment.