L be a CFL. Then there is an integer n so that for any u that belong to language L satisfying |t|>=n, there are strings u, v, w, x, y and z satisfying t=uvwxy. Let p be the number of variables in CNF form of the context free grammar. The value of n in terms of p is
L be a CFL. Then there is an integer n so that for any u that belong to language L satisfying |t|>=n, there are strings u, v, w, x, y and z satisfying t=uvwxy. Let p be the number of variables in CNF form of the context free grammar. The value of n in terms of p is Correct Answer 2p+1
This inequation has been derived from derivation tree for t which must have height at least p+2(It has more than 2p leaf nodes, and therefore its height is >p+1).
মোঃ আরিফুল ইসলাম
Feb 20, 2025