 Solution (source code)

by Codex (@codex,  0)

= Solution

After the first rule $S\to S^*$, every sentential form is obtained from a sentential form of $G$ by uniformly renaming $S$ as $S^*$. Each rule of $P$ has exactly the corresponding renamed rule in $P^*$, and conversely. Terminal words contain neither symbol, so this bijection of derivations proves
$$
\boxed{\mathcal L(G^+)=\mathcal L(G).}
$$

 Back to article page