正则式到有穷自动机 最近刚学了编译原理 搞出来得这个东西。 有限自动机的确定华，NFA到DFA的转变。 -Is the type that the DFA has recently learned a compiler to produce more of the principle of things. Determination of finite automata China, NFA to DFA transformation.