Pumping Lemma For Context-free Languages - Formal Statement

Formal Statement

If a language L is context-free, then there exists some integer p ≥ 1 such that any string s in L with |s| ≥ p (where p is a "pumping length") can be written as

s = uvxyz

with substrings u, v, x, y and z, such that

1. |vxy| ≤ p,
2. |vy| ≥ 1, and
3. uv nxy nz is in L for all n ≥ 0.

Read more about this topic:  Pumping Lemma For Context-free Languages

Famous quotes containing the words formal and/or statement:

    On every formal visit a child ought to be of the party, by way of provision for discourse.
    Jane Austen (1775–1817)

    He has the common feeling of his profession. He enjoys a statement twice as much if it appears in fine print, and anything that turns up in a footnote ... takes on the character of divine revelation.
    Margaret Halsey (b. 1910)