Use the pumping lemma to show that the following languages are not regular. A a. A 1

Question:

Use the pumping lemma to show that the following languages are not regular.

Aa. A1 = {0n1n 2n| n ≥ 0}

b. A2 = {www| w ∈ {a, b}*}

Ac. A3 = {a2n| n ≥ 0} (Here, a2n means a string of 2n a’s.)

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: