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. 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.
Step by Step Solution
3.36 Rating (177 Votes )
There are 3 Steps involved in it
Regular languages are closed under union concatenation star and complementation A ... View full answer
Get step-by-step solutions from verified subject matter experts
