The Gateway to Computer Science Excellence
0 votes
5 views
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 by Boss (11.4k points) | 5 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,647 questions
56,490 answers
195,432 comments
100,656 users