To solve this problem, an optimized algorithm for transition from NFA to DFA is put forward on the basis of characters of NFA and according to shortcomings of the subset. construction method.
为解决此问题，基于非确定有限自动机的特点并针对子集构造法的不足，提出了一种优化的非确定有限自动机确定化算法。
As you will see, it is possible to automatically convert an NFA into a DFA.
正如您将看到的，有可能自动地将NF A转换成dfa。
This paper through to research the equivalence and conversion of NFA and DFA in parallel environment, labor the method of NFA convert to DFA, and give a example of the process of parallel conversion.
本文通过对并行环境下非确定有限自动机和确定有限自动机的等价性和转换进行研究，详细分析了非确定有限自动机到确定有限自动机的并行转换方法及算法，并以实例给出了其间并行转化的过程。
应用推荐