# Pumping lemma regular language can't be pumped

Suppose we have a regular language that describes every string with the exact length of 3.That is obviously a regular language and it still can't be pumped because there is no cyclic behavior in that string/ the corresponding dfa

• No, each regular language has such a constant p (not every word in it). Your language has a p = 4. This is not setting the maximum size of the language (or changing anything about the language). – Bergi Aug 24 '15 at 14:57