Unformatted text preview: s ∈ L , where | s | ≥ p , such that, for all u,v,x,y,z ∈ Σ * , where s = uvxyz , | vxy | ≤ p , and | vy | 6 = 0 there exists some n ≥ 0 such that uv n xy n z / ∈ L . In other words, cleverly choose some s ∈ L and show that, no matter how you choose vxy (and, in turn, u and z ), there’s always some n ≥ 0 for which uv n xy n z / ∈ L . 1...
View Full Document
- Fall '09
- Computer Science, Formal language, Formal languages, Context-free grammar, context-free language, uv n xy