A program that takes a dfa as input and outputs the minimum possible states dfa with the same language as the input dfa

Run the following commands in the root directory:

• Compilation:

g++ -o "dfa-minimization" dfa-minimization.cpp

• Run the executable:

./dfa-minimization

You need to provide following details of the dfa:

• number of states;
• size of alphabet;
• alphabet;
• transition table;
• index of initial state;
• number of final states;
• indices of final states;

Following details will be printed:

• reachable states in the input dfa;
• reachable non-final states of the input dfa;
• reachable final states of the input dfa;
• number of equivalence states partitions;
• all equivalence states partitions;
• transition table of the equivalent minimized states dfa;