1 votes 1 votes Let $C$ be a context-free language and $R$ be a regular language$.$ Prove that the language $C\cap R$ is context-free. Let $A = \{w\mid w\in \{a, b, c\}^{*}$ $\text{and}$ $w$ $\text{contains equal numbers of}$ $a’s, b’s,$ $\text{and}$ $c’s\}.$ Use $\text{part (a)}$ to show that $A$ is not a CFL$.$ Theory of Computation michael-sipser theory-of-computation context-free-language regular-language + – admin asked May 4, 2019 edited May 4, 2019 by Lakshman Bhaiya admin 329 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes CFL $\cap$ RL $\rightarrow$ CFL let B=a*b*c* if A is CFL then A $\cap$ B should be CFL A $\cap$ B=$a^nb^nc^n$ which is not CFL hence, A 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.