摘要： 抓住入侵位串往往具有的相似性,在KMP字串匹配算法思想的基础上,结合图灵机模型抽象出了一种基于状态转移的字串匹配方案。通过对图灵机状态跳转函数的思索和状态树的构造,得到对于任意状态节点的最大后缀状态,从而大大地加快了识别器的识别效率。通过模拟实验,证明确实得到了较明显的提高。

关键词: 免疫识别器, 状态跳转匹配, 存在性匹配, 可选机模型, 多带图灵机

Abstract: This article emphasizes the similarities among character strings; based on the KMP algorithm, abstracts from the multi-belt turing machine model,gets a charater matching method. And it also gets the longest suffix state in state tree derived through the constructing of the state-jump function and effectively speeds up the character matching. The simulateing experiment verifies the method does have a significant improve.

中图分类号: 

• TP309