【摘要】 由于基于确定性有限自动机(DFA)的多模式匹配算法对内存的需求比较大,因此需要对DFA进行优化,以减少其对内存的需求量。算法通过用动态默认转移来替代DFA的failto转移,将DFA中大量的failto转移删掉,从而达到优化DFA的目的。实验结果证明,该算法能有效地优化DFA对内存的需求。更多还原

【Abstract】 The multi-pattern matching algorithm that based on Deterministic Finite Automata(DFA) needs a lot of memory.In order to reduce its memory requirement,the DFA is needed to optimize.This paper proposes a dynamic default transition algorithm to replace the failto transitions,eliminates most failto transitions of the DFA and achieves the memory optimization purpose.The experiment result shows the proposed algorithm can reduce the memory requirement of DFA effectively.更多还原