<Dl> <Dd> s = uvwxy </Dd> </Dl> <Dd> s = uvwxy </Dd> <P> with substrings u, v, w, x and y, such that </P> <Dl> <Dd> 1 . vwx ≤ p, </Dd> <Dd> 2 . vx ≥ 1, and </Dd> <Dd> 3 . uv wx y ∈ L for all n ≥ 0 . </Dd> </Dl>

What is pumping lemma for context free language