Question

Prove the given language as non-regular using pumping lemma L= { 0^i1^j |i>j} is non-regular​

Answer 1

Step-by-step explanation:

Method to prove that a language L is not regular

At first, we have to assume that L is regular.

So, the pumping lemma should hold for L.

Use the pumping lemma to obtain a contradiction − Select w such that |w| ≥ c. Select y such that |y| ≥ 1. Select x such that |xy| ≤ c. Assign the remaining string to z.