A version of the grep utility, in Java, called "Grepy," that searches files for regular expression, pattern matches and produces dot graph file output for the automata used in the matching computation.
0
stars
0
forks
source link
Implement subset construction of a DFA from an NFA #10
This will involve removing all of the epsilon transitions first... I think this has to do with epsilon closures... Anyway create a transition table for the NFA, takeout the epsilons, and from there generate the DFA
This will involve removing all of the epsilon transitions first... I think this has to do with epsilon closures... Anyway create a transition table for the NFA, takeout the epsilons, and from there generate the DFA