1. 1 武汉商业服务学院信息工程系,湖北,武汉,430056
2. 2 湖北大学 机构 数学与计算机科学学院,湖北,武汉,430062
3. 3 武汉大学软件工程国家重点实验室 机构,湖北,武汉,430072
Published:2013
移动端阅览
韩光辉, 曾诚. KMP算法的理论研究[J]. 微电子学与计算机, 2013, 30(4): 30-33.
HAN Guang-hui, CENG Cheng. Theoretical Research of KMP Algorithm[J]. 2013, 30(4): 30-33.
韩光辉, 曾诚. KMP算法的理论研究[J]. 微电子学与计算机, 2013, 30(4): 30-33. DOI:
HAN Guang-hui, CENG Cheng. Theoretical Research of KMP Algorithm[J]. 2013, 30(4): 30-33. DOI:
KMP算法是经典的串匹配算法之一.本文首先引入刻划模式串前缀特征的集合及其划分
讨论了其若干性质.然后定义函数与next
利用刻划了的构造
由此得到了的迭代计算方法;证明了next与之间的关系
从而给出了KMP算法原理的形式表述和数学证明.最后
基于的迭代计算方法以及next与之间的关系
给出了算法描述
分析了时间复杂度.
KMP algorithm is one of classic string matching algorithms.A set
for 1 <≤m
which characterize a pattern prefix
and its partition are introduced
their some properties are discussed.Then
functions and next are defined
the structure of is described by
a iterative computing method of is proposed
the relationship between functions next and is proved.Thus
mathematical principles of KMP algorithm is strictly established. Finally
the algorithm is described based on the iterative computing method of and the relationship between functions next and
and its complexity is analyzed.
0
Views
12
下载量
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution