in Theory of Computation
1,256 views
0 votes
0 votes

If  $L_1$ is DCFL and $L_2$ is context free language. Consider the below given statements

Which is correct between these and why ? (S1 is correct.. but why ??) . I couldn’t understand the explanation given in the solution..

in Theory of Computation
1.3k views

4 Comments

It is simple.

DCFL is not closed under complementation. So, it should be CFL.

Now, CFL - CFL => we can rewrite as CFL intersection CFL'.  And CFL is not closed under intersection. So, it is CSL.
0
0
What will be S2?Is it  CSL?because DCFL-CFL'=DCFL intersection CFL=CSL?Am i right?
0
0
Yes, Perfect
0
0
DCFL is closed under complementation
0
0

1 Answer

1 vote
1 vote

S1:  $\bar{L_{1}}$  - ${L_{2}}$  : True
it can be written as $\bar{L_{1}}$  $_{\bigcap }$ $\bar{L_{2}}$   , L2 is given as CFL and CFL is not closed under complementation and it will fall in 1 higher class of language CSL.

S2: $\bar{L_{1}}$  - $\bar{L_{2}}$ : False

it can be written as  $\bar{L_{1}}$  $_{\bigcap }$ ${L_{2}}$ , which is again not closed under intersection/union.

 

If L1 and L2 are CFLs, then L1 ∩ L2 may not be a CFL.

Both CFL and DCFL are closed under intersection with regular sets.

reshown by

1 comment

Can u explain it in a more clear manner?
0
0

Related questions