Unformatted text preview: s ∈ L , where | s | ≥ p , such that for all x,y,z ∈ Σ * , where s = xyz , | xy | ≤ p , and y 6 = e , there exists some n ≥ 0 such that xy n z / ∈ L . In other words, cleverly choose some s ∈ L and show that, no matter how you choose xy (and, in turn, z ), there’s always some n ≥ 0 for which xy n z / ∈ L . 1...
View Full Document
- Fall '09
- Computer Science, Formal languages, Regular expression, Regular language, regular languages, Pumping lemma for regular languages