If L is context free and R is regular then R – L must be context free? Hi I am wondering if L is a CFL and R is RL then would the difference R - L be a context free language?
The difference might be the CF part of the language left then it would be, but I'm not sure how I could go about proving this without giving an example
Context-free languages are not closed under complement. This is a fairly well-known result.