0 votes 0 votes Let L1 = {an bm cn⎪m, n ≥ 0} and L2 = {an cn⎪n ≥ 0}. Both L1 and L2 are context free languages. If L = (L1 – L2) then L is ________ Finite language Regular language DCFL Not DCFL can anyone give the elaboration..?? iita asked Jan 12, 2017 iita 235 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes L=(L1 – L2)={anbmcn | n>=0,m>=1} it is DCFL. saurabh rai answered Jan 12, 2017 saurabh rai comment Share Follow See 1 comment See all 1 1 comment reply iita commented Jan 12, 2017 reply Follow Share what is the logic behind subtraction of two languages..?? 0 votes 0 votes Please log in or register to add a comment.