in Theory of Computation
136 views
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$
in Theory of Computation
136 views

Please log in or register to answer this question.

Related questions