a. Let C be a context-free language and R be a regular language. Prove that the language C∩R is context free.

b. Let A = {w|w ? {a, b, c} ^* and w contains equal numbers of a's, b's, and Cs} Use part (a) to show that A is not a CFL.

Answer rating: 100% (QA)

a Let c be a context free language and R be a regular language Now we have to prove that the language c n R is a context free In order to prove let us ... View the full answer