0 votes 0 votes Use the languages $A=\{a^{m}b^{n}c^{n}|m,n\geq 0\}$ and $B=\{a^{n}b^{n}c^{m}|m,n\geq 0\}$ together with $\text{Example 2.36}$ to show that the class of context-free languages is not closed under intersection. Use part $(a)$ and $\text{DeMorgan’s law (Theorem 0.20)}$ to show that the class of context-free languages is not closed under complementation. Theory of Computation michael-sipser theory-of-computation context-free-language + – admin asked Apr 30, 2019 edited May 1, 2019 by Lakshman Bhaiya admin 461 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes $L1\cap L2=a^nb^nc^n$ which is not CFL aditi19 answered Aug 14, 2019 aditi19 comment Share Follow See all 0 reply Please log in or register to add a comment.