Theory of Computation

Pumping Lemma Pumping lemma is used to prove that a language is not regular. To prove this the following three conditions must satisfy: xyiz where i≥0 |y|>0 |xy|≤P Let us consider an example A={yy/y€{0,1}* } Proof: we know that *