A tool for minimizing any given DFA (Deterministic finite automaton)
No Dependency needed.
The input DFA should be formatted in the following way:
NumOfStates SizeOfAlphabet
{Final States}
{
Transitions
}
Consider the following DFA:
The equivalent Input is:
2 2
1
2 1
1 2
- States start from number 1
- State 1 is always the start state
The same as the input format
Steps:
- Removing Dead states (non-final states that only transit to themselves)
- Removing Inaccessible states (States that can not be reached from intial states)
- Performing Myphill-Nerode algorithm using Java data structures