retagged by
663 views

2 Answers

Best answer
3 votes
3 votes
A language is context-free only when it has only one condition in the formation of language.

For example $ L_1 = \{ a^n b^n | n>= 0 \} $

A regular language, will not have any conditions.

For example $ L_2 = {(a + b)}^* $

So Intersection, of condition and non condition will return that one condition,

Hence $ L_1 \cap L_2 = L_1 = \{ a^n b^n | n>= 0 \} $ Hence, Context free.
selected by
1 votes
1 votes
C: Context free language

R: Regular language

Every regular is context free but every context free is not regular

C(Context free)  INTERSECT  R(Regular)

C(Context free)  INTERSECT   R(Context free)                           Every Regular is context free

Output: CFL is not closed under Intersection

how can this be true  because CFl are not closed under intersection!!!!

plz make me correct if  i m wrong
reshown by

Related questions

0 votes
0 votes
0 answers
1
baofbuiafbi asked Nov 14, 2023
151 views
Prove the language L={(G,H)|G is a CFG, H is a DFA, and L(G)∩L(H)=∅} is undecidable.