3. The method of claim 1 wherein mapping includes: determining whether there are unmarked DFA states within the number of DFA states; selecting one of the unmarked DFA states to produce an unmarked DFA state; marking the unmarked DFA state to produce a marked DFA state; and determining the transitions of the one or more NFA states of the NFA graph mapped to the marked DFA state to other NFA states for the character of the alphabet recognized by the NFA graph.
3. The method of claim 1 wherein mapping includes: determining whether there are unmarked DFA states within the number of DFA states; selecting one of the unmarked DFA states to produce an unmarked DFA state; marking the unmarked DFA state to produce a marked DFA state; and determining the transitions of the one or more NFA states of the NFA graph mapped to the marked DFA state to other NFA states for the character of the alphabet recognized by the NFA graph. 4. The method of claim 3 wherein determining the transitions includes mapping the other NFA states and an epsilon closure of the other NFA states to a possible new unmarked DFA state.