- D Consider The Language We Want To Prove That Is Not Regular Suppose Is Regular Such That For Every X According To Th 1 (105.45 KiB) Viewed 47 times
D. Consider the language We want to prove that is not regular. Suppose is regular. such that for every x According to the pumping lemma for regular languages, there exists an n L with x ≥n, x can be written uvw for some u, v and w with |uv| ≤n, v> 0, and for any m≥ 0, uv w € L. Let n be the integer in the statement of the pumping lemma. Choose x so that || ≥ n. Complete the proof. I=. Then uv . This implies that w Moreover, v=_ L = {x{a,b}* | na (x) > no (x)} . According to the lemma, uvmw E L for every m ≥ 0. Consider For m =. uvmw = 11 11 since. This contradicts the lemma, therefore our assumption that is regular is wrong. " uvmw & L, 8 mark(s)