Give a counterexample to show that the following construction fails to prove that the class of context-free

Question:

Give a counterexample to show that the following construction fails to prove that the class of context-free languages is closed under star. Let A be a CFL that is generated by the CFG G = (V, Σ,R, S). Add the new rule S → SS and call the resulting grammar G0. This grammar is supposed to generate A*.

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

Step by Step Answer:

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