### Lecture 15 Pumping Lemma

Lecture 15 Pumping Lemma. Consider a CFG G = (V, ? , R, S). Assume for any rule A ? w in R, |w| < c for a constant c > 0. For x in L(G), consider a parse tree T for x. . s. > log c |x|. x. This tree would have at least |x| leaves. Therefore, the depth of this tree > log c |x|.

★
★
★
★
★

280 views • 15 slides