0 votes 0 votes Show that for every unrestricted grammar there exists an equivalent unrestricted grammar, all of whose productions have the form $u\rightarrow v,$ with $u,v\in (V \cup T)^+$ and $|u| \leq |v|$, or $A\rightarrow\lambda$ with $A\in V$ Theory of Computation peter-linz peter-linz-edition5 theory-of-computation proof turing-machine recursive-and-recursively-enumerable-languages + – Rishi yadav asked Mar 17, 2019 Rishi yadav 140 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.