Question: Problem 7 ( 6 points ) Suppose you were trying to prove that the language { a b n + 1 c n d |
Problem points
Suppose you were trying to prove that the language is not regular and you are using the proof by contradiction using the pumping lemma style proof we discussed in class.
You decide to prove this using the string where is the number from the pumping lemma.
In your proof you state that can be split into pieces, and as described in the pumping lemma. Now I am going to ask you some questions about what and look like.
Circle the best answer for each line of the table below in other words: circle "yes" if the answer is definitely yes; circle no if the answer is definitely no; and circle "maybe" if the answer could be yes but also could be no parts, points each
tableIs it possible that x might be Yes,NoDoes x contain the symbol aYes,Maybe,NoDoes x contain the symbol bYes,Maybe,NoDoes x contain the symbol cYes,Maybe,NoDoes x contain the symbol dYes,Maybe,NoIs it possible that y might be Yes,NoDoes y contain the symbol aYes,Maybe,NoDoes y contain the symbol bYes,Maybe,NoDoes y contain the symbol cYes,Maybe,NoDoes y contain the symbol dYes,Maybe,NoIs it possible that z might be Yes,NoDoes z contain the symbol aYes,Maybe,NoDoes z contain the symbol bYes,Maybe,NoDoes z contain the symbol cYes,Maybe,NoDoes z contain the symbol dYes,Maybe,No
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
