title: To make sure: Pumping lemma for infinite regular languages only?
body: <p>So this is not about the pumping lemma and how it works, it's about a pre-condition.</p>
  
  <p>Everywhere in the net you can read, that regular languages must pass the pumping lemma, but noweher anybody talks about finite languages, which actually are a part of regular languages.</p>
  
  <p>So we might all aggree, that the following language is a finite language as well as it's a regular one, but it definitely does not pass the pumping lemma:</p>
  
  <p><code>L = {'abc', 'defghi'}</code></p>
  
  <p>Please, tell me if simply no one writes about it or <strong>why</strong> we're wrong - or even not.</p>