点击次数：

发表时间：2022-10-09

发表刊物：计算机研究与发展

期号：12

页面范围：2699-2706

ISSN号：1000-1239

摘要：Advanced AC (AAC) is the most widely used multi-patterns string matching algorithm. The building cost of AAC automaton is high for large-scale matching. In this article, the automaton building method of DFA (a basic single pattern string matching algorithm) is improved and it is expanded into multi-patterns matching field. Thus, an automaton for multi-pattern string matching called Set DFA is proposed and it is proved to be same as AAC automaton. The building method of Set DFA can be described in two steps: 1) Building trie and setting all undefined trans of the initial state point to the initial state. 2) Accessing all states of the trie in level-order, and setting all undefined trans. Let the string along the path from the initial state to the accessed state be u1u2uk, and let the trans character of the undefined trans be c, this undefined trans should be set to point to the result state after the string of u2ukc being inputted from the initial state on existing automaton. This building method can be also improved to liner time building. The experimental results indicate that building Set DFA is about two times faster than building AAC automaton, because AC failure function is not used in buliding Set DFA and each state in Set DFA just is accessed once after being generated.

备注：新增回溯数据