The Gateway to Computer Science Excellence
0 votes
5 views
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$

Show that the conclusion still holds if we add the further conditions $|u|\leq2$ and $|v|\leq2$
in Theory of Computation by Boss (11.6k 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,737 questions
57,295 answers
198,261 comments
104,970 users