RLs Pummping lemma


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











