711 views

3 Answers

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$
selected by
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$

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..

Related questions

1 votes
1 votes
3 answers
1
Shefali asked Oct 24, 2015
765 views
$L=\left\{ w\in(a+b)^* \mid w \\ \text{ has at least as many occurrences of (bba)'s as (abb)'s}\right\}$    Identify the class of the language.
0 votes
0 votes
1 answer
2
admin asked Sep 23, 2015
1,316 views
Identify the class of the language $L = \Bigl \{a^n b^m \mid n \leq m \leq 2n\Bigr \}$.a) CFL but not DCFLb) DCFL but not regularc) not CFL