Chapter 2: Context-Free Languages

For Your Enjoyment

Chapter 2.3, Non-Context-Free Languages

CFL Pumping Lemma

If A is a context-free language, then there is a number p (the pumping length) where, if s is any string in A of length at least p, then s may be divided into five pieces s = uvxyz satisfying the conditions

  1. for each i ≥ 0, uvixyiz ∈ A,
  2. |vy| > 0, and
  3. |vxy| ≤ p.

Lecture Problem

Active Learning Problem

In-Class Notes

Valid XHTML 1.0!