question archive Give a counter example to show that the following construction fails to prove that the class of context-free languages is closed under star
Give a counter example to show that the following construction fails to prove that the class of context-free languages is closed under star
Subject:MathPrice: Bought3
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 G = (V, å, R, S) . Add the new rule S ® SS and call the resulting grammar G’. This grammar is supposed to generate A*.
