automaton ( NFA ) can be an equivalent deterministic finite automaton ( DFA ), L ( N ) =L ( M ). This paper mainly introduces how to convert NFA to equivalent simplified DFA, through concrete examples, combined with graphics, a detailed description of the algorithm principle of conversion....
draw NFA , convert to DFA , minimize DFA , export all graphs Topics nfa dfa dfa-minimization dfa-implementation nfa-implementation nfa-to-dfa-conversion License GPL-3.0 license Activity Stars 2 stars Watchers 0 watching Forks 1 fork Report repository Releases No releases published Pac...