Show that if $A$ is a context-free language and $B$ is finite, then $A - B$ is a context-free language.
I'm just not sure how to use their properties to formally show this. Thanks for all the help in advance.
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.Sign up to join this community