Use the pumping lemma to show that the following languages

Chapter , Problem 1.29

(choose chapter or problem)

Get Unlimited Answers
QUESTION:

Use the pumping lemma to show that the following languages are not regular. Aa. A1 = {0n1n2n| n 0} b. A2 = {www| w {a,b}} Ac. A3 = {a2n| n 0} (Here, a2n means a string of 2n as.)

Questions & Answers

QUESTION:

Use the pumping lemma to show that the following languages are not regular. Aa. A1 = {0n1n2n| n 0} b. A2 = {www| w {a,b}} Ac. A3 = {a2n| n 0} (Here, a2n means a string of 2n as.)

ANSWER:

Step 1 of 4

Pumping lemma is used to prove the non-regularity of the language. Long strings of the language will be pumped into the lemma, if any of the string is not pumped out then the language is not regular.

If language A is regular, the pumping length is denoted by . Any string in  is denoted by  must satisfy the following conditions:

For each

 

Add to cart


Study Tools You Might Need

Not The Solution You Need? Search for Your Answer Here:

×

Login

Login or Sign up for access to all of our study tools and educational content!

Forgot password?
Register Now

×

Register

Sign up for access to all content on our site!

Or login if you already have an account

×

Reset password

If you have an active account we’ll send you an e-mail for password recovery

Or login if you have your password back