Seong-lae ChoDeterministic finite automaton
A minimal DFA does not include nodes (and their outgoing transitions) that have no incoming transitions, and it also excludes sink states.
A finite state machine that takes a unique state transition for each symbol in each input string