说明：  由RE-NFA，再从NFA-DFA，再进行DFA的最小化 中间由C++的状态变化表实现其功能。（模拟一个自动机翻译的过程）
(From RE-NFA, from NFA-DFA, to DFA minimization. The function is realized in the middle by the state change table of C++. (simulation of a process of automaton translation))