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

Question:

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 c’s}. Use part (a) to show that A is not a CFL.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: