0 votes 0 votes Consider 2 regular expression: i. ϕ* + a+ + b+ + (a + b)+ → r1 ii. ϕ+ + a* + b* + (a + b)* → r2 (a) L(r1) = L(r2) (b) L(r1) ⊆ L(r2) (c) L(r1) ⊇ L(r2) (d) None of above Solution: Option (a) how need explanation? wont answer be c? Theory of Computation theory-of-computation sample gatecse-2018 practice context-free-grammar + – Pranav Madhani asked Nov 17, 2017 Pranav Madhani 1.0k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply joshi_nitish commented Nov 17, 2017 reply Follow Share option a) is correct. L(R1) = L(R2) = (a+b)* 0 votes 0 votes abhishek tiwary commented Nov 19, 2017 reply Follow Share (1) epsilon+a+b+(a+b) (2) phai+epsilon+epsilon+epsilon minimum string genrated 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes .... Hira Thakur answered Nov 17, 2017 Hira Thakur comment Share Follow See all 2 Comments See all 2 2 Comments reply Pranav Madhani commented Nov 17, 2017 reply Follow Share but in r1 + is given so dont = means 1 or more ? while * means 0 or more then wont + be subset of *? 0 votes 0 votes joshi_nitish commented Nov 19, 2017 reply Follow Share but in R1, there is also ϕ* = epsilon, now everthing else could be generated by (a+b)+ 0 votes 0 votes Please log in or register to add a comment.