Question: 7. Let = {a,b}. Let A = {w | w = w^R, where w * and w^R denotes the reverse of w}. Use the pumping
7. Let = {a,b}. Let A = {w | w = w^R, where w * and w^R denotes the reverse of w}. Use the pumping lemma for regular languages to give a proof that A is not a regular language.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
