...FA确定化算法 关键词：子集构造法；非确定有限自动机；优化的；确定化算法 [gap=1366]Key words：subset construction method；non-deterministic finite automam；optimized；algorithm for transition from NFA to..
基于1个网页-相关网页
Absrtact: the problem of repetitive computing exits in the process of transition from non-deterministic finite automata to deterministic finite automata using the subset construction method.
摘要：使用子集构造法对非确定有限自动机进行确定化的过程中存在大量重复计算的问题。
In other words, a method Definition corresponds to the subset of the RMC Library relevant to the method under Construction.
换句话说，一个方法定义对应着被构建方法相关的RMC库子集。
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.
为解决此问题，基于非确定有限自动机的特点并针对子集构造法的不足，提出了一种优化的非确定有限自动机确定化算法。
应用推荐