Minimization of DFA Implement the algorithm from HMU for minimizing the number of states in a DFA (pp. 154-156).

Read the input of the given DFA from a file (number of states, alphabet, transition table, final states), and print the description of the minimized DFA (transition table, final states) obtained as the output.

Also output the table of distinguishabilities for each of the automata above, and indicate in which stage the cells are marked.

As input problems use the automata from the Exercises 4.4.1 and 4.4.2, HMU (pp. 164-165), the example problem of Fig. 4.8 p. 155, and the problems #45(a-c) of Sudkamp Ch. 5.

For exercise 4.4.2 (HMU) and #45(a,c) (Sudkamp) add your written solution to this assignment.

Now give the original as well as the minimized automata as input to your DFA simulator, each for a string in their accepted language and a string not in the language.

Show all inputs (including the DFA transition tables) and outputs for strings that should be accepted and strings that should be rejected.

Also submit a listing of your well-documented simulator and minimization programs, and a screenshot or job log (typescript file) showing compilation and execution.

Need help with the java program for minimization of DFA