Question
Download Solution PDFContext free grammar is not closed under:
Answer (Detailed Solution Below)
Detailed Solution
Download Solution PDFConcept:
Context free languages are closed under Union, Concatenation and Kleene Closure (star)
CFLs are NOT closed under intersection and not closed under complementation
Example:
L1 = pn qn rm | m, n > 0 → CFL
L2 = pm qn rn | m, n > 0 → CFL
L = pn qn rm ∩ pm qn rn | m, n > 0. L = pn qn rn it is not accepted by pushdown automaton and hence it is not a CFL. and hence it is not closed under intersection.
Important Point:
|
Context free languages |
Only Deterministic Context free languages |
|
Closed under
|
Closed under
|
|
Not Closed under
|
Not Closed under
|
Last updated on Jun 12, 2025
-> The UGC NET June 2025 exam will be conducted from 25th to 29th June 2025.
-> The UGC-NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.
-> The exam is conducted bi-annually - in June and December cycles.
-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions.
-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.