Chapter 0: Q15E (page 1)
Give a counter example 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 . Add the new rule and call the resulting grammar. This grammar is supposed to generate A*.
Short Answer
Answer.
The construction fails for