从NFA到DFA的转换过程是利用NFA的信息不断生成DFA的状态结点和边的过程，或者说是生成DFA自动机转换表元素的过程。求ε-闭包也就是把用ε边连接起来的状态合并起来的过程，被合并的状态集将形成DFA的一个状态，因此DFA的状态被表示为NFA的状态子集。

用SS(状态集)的形式表示DFA的状态。假设SS表示新产生的状态，则下一步的工作是：对每个符号a考虑其边和该边的指向状态。

-From the NFA to DFA conversion process is the use of information continuously generated NFA state DFA nodes and edges of the process, or to generate automata DFA conversion table of the process elements. Ε-closure order is to connect with ε while the status of the process of merging, the merger will form the state set a state of DFA, the DFA state is expressed as a subset of the state of NFA. With SS (state set) of the form of the state DFA. SS assumptions that the status of the newly elected, the next step is: for each symbol a consideration of its edge and the edge point to state.