Pumping Lemma for CFL

1 min read Updated Fri Apr 24 2026 07:36:29 GMT+0000 (Coordinated Universal Time)

Let LL be a CFL. Then nN\exists n \in \mathbb{N} such that uL\forall u \in L satisfying un|u| \ge n, there are strings v,w,x,yv, w, x, y and zz satisfying:

  • u=vwxyzu = vwxyz
  • wy>0|wy| \gt 0
  • wxyn|wxy| \le n
  • For any m0m \ge 0, vwmxymzvw^mxy^mz is in LL

Ogden’s Lemma

A generalization of the pumping lemma for CFL. Can designate “distinguished” positions of uu. Can guarantee pumped up portions include at least some of these distinguished positions. Sometimes more convenient to use; can also use when the pumping lemma fails.