一种字符串模式匹配算法的实现

Algorithm Implementation of Pattern-matching of string

为寻求更有效的字符串搜索方法,利用有穷自动机的定义,分析KMP算法以及自动机状态转换规律,提出了一种新的字符串模式匹配算法.结果表明此算法具有比基本的串匹配算法更优越的算法复杂度,并且相对KMP算法而言更简洁易懂,在计算机上容易实现.

For more efficient algorithm to search string,this paper presents a new algorithm of patternmatching in string by analyzing Knuth-Morris-Pratt algorithm and state transition rules of deterministic automata. The computational complexity of the new algorithm is better than basic algorithm of patternmatching in string,and it is also easy to be implemented