Checking DFSA equivalence

Write a well-structured program for checking equivalence of DFSA's. This will take the following steps: 1. Eliminate unreachable state(s) As state#1 is the initial state, any state unreachable from state#1 must be identified and removed from further consideration (before taking the next step of minimization) 2. Make sure that each DFSA is completely specified. That is, each state of the DFSA has an outgoing transition on every (possible) input symbol. 3. Minimize each DFSA. This step will check if two accepting states or two non-accepting states are equivalent as equivalent states can be combined into just one state. Two states are equivalent if there is no "Distinguishing" string for them. 4. Compare two minimized DFSA's for their equivalence. Two Minimized DFSA's are equivalent if and only if a. they have the same total number of states and b. they have the same total number of accepting states and c. they have the same total number of non-accepting states and b. they have the same set of transitions after a suitable renumbering of states (like a lexicographical ordering) Output requirements can be found in the attached document