Solution Found!
Use the pumping lemma to show that the following languages
Chapter , Problem 1.29(choose chapter or problem)
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