Homework No. 3 - NFA --> DFA + minimisation
Convert your NFA from Homework No. 2 into a DFA. Identify if this DFA is (already) minimized. If it is not, minimize it.
Hint: Use the "table filling method" for minimizing your DFA (if needed).
Instructions:
Your submission should include the DFA that you got from the conversion, the "minimization table" with distinguishable pairs of states and the minimized DKA.
Do not draw automata by hand. Find a software for drawing automata (you can try JFlap) and submit a pdf of the drawing - photos or scans of your handwriting will not be accepted !!!
Submit your solution in the form of a PDF file named <N03-LastnameFirstname.pdf> using just English alphabet characters (example: N03-KavsekBranko.pdf)!
Submissions not following these instructions will be rejected and graded with 0 points!!!