title: Pumping lemma on regular languages?
body: <p>I am a bit confused on the theory of the pumping lemma. As I know is used to decide if a language is regular or not.
  There is a variable let be m such that is the states?</p>
  
  <pre><code>x = vxu
  Where vx &gt;= m
  And u not ε (&gt;=1)
  and a variable i such that v(x^i)u
  </code></pre>
  
  <p>So i cant understand how this is working. I mean where is that useful? By breaking a string into 3 parts and repeat the x?
  And how is that showing if it is regular or not?
  And is any difference between pumping lemma for regular languages and context-free languages?</p>