Question: 2. Consider the language: (a) Construct a DFA that recognizes the above language. (b) Show that ANY DFA for the above language must contain a

2. Consider the language: (a) Construct a DFA that recognizes the above language. (b) Show that ANY DFA for the above language must contain a dead state Hint: Find a string x {a,b)' such that every string of the form w-zy where y e {a, b)" is not in the language
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
