183 views
1 votes
1 votes

1.Let L be a CFL and R be a Regular language then 

L  $\cap$ R =

GIVEN:- always CFL and  need not be Regular 

BUT WHY NOT:- always CFL  as well as always Regular

R - L =

GIVEN:- always CSL and need not be CFL 

BUT WHY NOT:- always CSL  as well as always Regular

2.Let D be a DCFL and R be a Regular language then 

D  $\cap$ R =

GIVEN:- always DCFL and  need not be Regular 

BUT WHY NOT:- always DCFL  as well as always Regular

R - D =

GIVEN:- always DCFL and need not be Regular 

BUT WHY NOT:- always DCFL  as well as always Regular

PLEASE GIVE DETAIL EXPLANATION WHY NOT??

Please log in or register to answer this question.

Related questions

4 votes
4 votes
1 answer
1
anurag sharma asked Dec 24, 2018
1,899 views
What is difference between Σ* and L* ? Which is true ?S1 : Σ* – {ϵ} = Σ+S2 : L* – {ϵ} = L+ .
3 votes
3 votes
1 answer
2
iarnav asked Nov 1, 2017
585 views
If L1 = Regular L and L2 = CFL then L1 UNION L2?= L1 U L2= Reg L U CFL= CFL U CFL= CFL is it True?
1 votes
1 votes
0 answers
3
dragonball asked Aug 16, 2017
530 views
Can anyone elaborate the properties of regular language with non regular under union, intersection, set difference , complement etc.
1 votes
1 votes
0 answers
4