Description
PROFESSIONAL, Proving languages are not regularly using the pumping lemma
Unformatted Attachment Preview
HW 07-01 Proving languages are not regular
using the pumping lemma
HW 07 – Foundations – Proving languages are not regular using the pumping
lemma
Before you start doing the first few problems, I want to give you a couple of examples of what I’m looking for in
an answer.
Example question (from a hypothetical quiz):
○ Suppose that you were trying to prove that the language anbcban was not regular and you are using the
proof by contradiction using the pumping lemma style proof we discussed in class.
○ Further suppose that you chose the string ambcbam (where m is the number from the pumping lemma)
for your string.
○ “what do x, y, and z look like?”
Here’s a good answer:
○ Since the first m letters are all a’s, and x&y have to come from the first m letters, here’s what x, y, and z
look like:
■ y = ak where 1
Purchase answer to see full
attachment
