pumpinglemma1

pumpinglemma1 - s L , where | s | p , such that for all...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Computer Science E-207 Pumping Lemma for Regular Languages Pumping Lemma for Regular Languages, Strong Version If L is a regular language, then there exists a constant p such that, for any string s L , where | s | ≥ p , there exist strings x,y,z Σ * , where s = xyz , | xy | ≤ p , and y 6 = e , such that, for all n 0, xy n z L . To show that some language, L , is not regular, you simply need show that. .. For all p 0, there exists some
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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 ), theres always some n 0 for which xy n z / L . 1...
View Full Document

This document was uploaded on 12/24/2011.

Ask a homework question - tutors are online