retagged by
722 views
1 votes
1 votes
How to prove this..

CFL is closed under intersection with regular languages.
retagged by

1 Answer

–2 votes
–2 votes
Absolutely not.

CFL is not closed under intersection with regular language,

Suppose we have a

L1=a^nb^n(CFL)

L2=ϕ(regular languages)

L1UL2=CFl

But in the case of DCFL .It will be right.

Related questions

4 votes
4 votes
2 answers
1
dd asked Aug 17, 2016
1,248 views
$L = \left \{ a^nb^n \ ; n\geq 0 \ , n \neq 20 \right \}$ is(a) a DCFL(b) a recursive set but not CFL(c) a CFL but not DCFL(d) not a CFL
3 votes
3 votes
1 answer
2
iarnav asked Nov 1, 2017
554 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
Na462 asked Sep 9, 2018
1,819 views
If L1 is CSL and L2 is CFL, then which of the following is correct ?A.L1' - L2 is CSL alwaysB. L1 - L2' is CSL alwaysC. L1 intersection Regular is Regular alwaysD. L1.L2...
1 votes
1 votes
1 answer
4
raviyogi asked Dec 30, 2017
668 views
CFL over a single alphabet are always->A. dcflB. regularC. dcfl but not regulard. non regular