12 views
$\text{Theorem}:$ For every recursively enumerable language $L$, there exists an unrestricted grammar $G$, such that $L = L(G)$.

Give the details of the proof of the Theorem.
| 12 views