Pumping lemma

Question

What exactly does it means when we say that a particular string can be pumped or not in pumping lemma?,,.. and consequently what is the pumping length for a regular language in pumping lemma?

Comments

@aambazinga: pumping lemma is for Regular languages particularly INFINITE.. and simple meaning is to consider regular language as xyⁱz with i=0 to any value, if we pump y as per i it will still regular..

BUT we need to take utmost care to choose i and y .. because sometimes you mistakenly consider a language to be regular though it is not & vice versa simply by assuming wrong value of i & y

---

@Abbas,

I know how it works... I'm asking about the pumping length.