2 votes 2 votes Consider$L_1 = \left\{a^nb^nc^md^m \mid m,n \ge 1\right\}$$L_2 = \left\{a^nb^n \mid n \ge1\right\}$$L_3 = \left\{(a+b)^*\right\}$$L_1$ - $L_3$ is(A) Regular (B) CFL but not regular (C) CSL but not CFL (D) None of these Theory of Computation theory-of-computation identify-class-language + – Arjun asked Apr 28, 2016 Arjun 711 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 6 votes 6 votes CFL $L_1 - L_3 = L_1$, hence CFL Proof, $L_1 - L_3 = \{abcd,aabbcd,aaabbbccdd,\dots\} - \{\epsilon ,a,b,ab,aab,\dots\}$ $= \{abcd,aabbcd,aaabbbccdd,\dots\}$ $= L_1$ Arjun answered Apr 28, 2016 • selected Apr 28, 2016 by srestha Arjun comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments srestha commented Apr 28, 2016 reply Follow Share but ∅ means regular then L2-L3 = regular too 1 votes 1 votes Arjun commented Apr 28, 2016 reply Follow Share yes, it is regular. 1 votes 1 votes Deepak Yadav commented Dec 31, 2016 reply Follow Share {an.bn - (a+b)* } = Reguler because L2 is subset of L3 and if i follow clousre table then answer is CFL. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes L1 - L3 =L1 $\bigcap$ L3' = L1 $\bigcap$ $\phi$ = $\phi$= Regular So, option A Regular should be ans. Note :- L3=$\sum$* So L3'=$\phi$ Rajesh Pradhan answered Dec 31, 2016 Rajesh Pradhan comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes L1 is DCFL which is also CFL L2 is DCFL which is also CFL and L3 is Reguler then L1 - L3 = L1 Therefore option B is Correct.. Deepak Yadav answered Dec 31, 2016 Deepak Yadav comment Share Follow See all 0 reply Please log in or register to add a comment.