Question: Construct both an NFA and a DFA which will recognize the language over {a,b} consisting of all words where the third to last letter is
Construct both an NFA and a DFA which will recognize the language over {a,b} consisting of all words where the third to last letter is "b" (meaning the letter two before the last letter). Then minimize your DFA (or confirm that it is already minimal).
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
