RLs Pummping lemma

  1. let L reg
  1. Sing L reg, L satisfy PL
  1. let PL constatnt n
  1. then choose w = w(p)
  1. by PL w can be factorized into xyz where |xy| ≤ n, |x| ≥ 0, |y| > 0
  1. for all i ≥ 0 xyz \in L
  1. so we can let y = n(k)
  1. consider i = i(k, n)
  1. show contradiction which are not in L that is x^i y z^i
 
 
 
 
 
 
 
 
 

Recommendations