Answered You can hire a professional tutor to get the answer.
QUESTION
6. Let A = {w#w | w 6 {a,b}*}. Use the pumping lemma for regular languages to give a proof that A is not a regular language. Hint: What is 2?
Please help for this question. It asks for using the pumping lemma to prove that this machine is not right. I know that we are supposed to find a loop in this machine to prove it is not finite, but I don't know how.
