Question: Q2. Prove that the following language is not regular. (1) L = { a2n b3nan | n 0 }. (2) L = {w {a, b}

Q2. Prove that the following language is not regular. (1) L = { a2n b3nan | n 0 }.

(2) L = {w {a, b} | w has more as than bs }.

(3) L = {0n1m0n | m, n 0}

Use pumping lemma to solve this question.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!