• edited by
1,027 views
0 0 votes
Consider a grammar $G$ with productions $P$. Let $INIT(G)$ be the grammar with production $P'$ such that

    $P' = P \cup ( A\rightarrow B \mid \text{such that } A->BC \text{ belongs to } P ) \cup ( A\rightarrow \epsilon \mid \text{such that} A\rightarrow b \text{ belongs to} P )$

    prove that:

a) Prefix(G) is subset of INIT(G)

b) INIT(G) is subset of Prefix(G)

Please log in or register to answer this question.

Position:
Show:

Related questions

2 2 votes
0 0 answers
593
593 views
rahul sharma 5 asked Mar 18, 2018
593 views
if degree of vertices < 3, then prove that the graph will be union of vertex disjoint path and cycle
0 0 votes
0 0 answers
721
721 views
rahul sharma 5 asked Mar 18, 2018
721 views
Graph Matching was explained. Let $S$ and $R$ be the matching graph, then a new graph $G=(S-R) \cup (R-S)$, will be union of vertex disjoint path and cycle. Also prove th...
0 0 votes
0 0 answers
578
578 views
ne0n asked Apr 20, 2018
578 views
Hey Guys,How to prepare for the IITK programming test.what is the level of questions??Any sample questions from previous years?? Please guys any help wud be appreciated.T...
1 1 vote
1 1 answer
1.5k
1.5k views
pC asked Jul 18, 2016
1,530 views
Implement Longest Increasing Subsequence with the help of 1-D array for dynamic programming. (Hint : MaxTill 1-D array)