字符串匹配算法.pptVIP

字符串匹配算法 问题的提出 记号 P 需寻找匹配的模式串 T the text in which P is sought m the length of P n the length of T,not known to the algorithm,used for analysis only. pi, ti the ith characters in P and T are denoted with lowercase letters and subscripts. The initial index of both P and T is assumed to be 1. j current position within T k current position within P 一、简单字符串匹配算法 P486程序 二、KMP算法 应用有限自动机进行模式匹配 Definition 10.2 Let ? be the alphabet, or set of characters,from which the character in P and T may be chosen, and let ? =? ? ?. The flowchart , or finite automaton, has two types of nodes: Some read nodes, which mean “Read the next text character. If there are no further character in the text string, halt; there in no match.” One read node is designated the start node. A stop node, which means “Stop; a match was found.” It is marked with a *. Each arrow is labeled with a character from ?. The arrow that matches the text character just read is the arrow to be followed; that is , it indicates which node to go to next. 例 P488 只有三个字母：A、B、C 的有限状态机流图 字符串匹配流图 read nodes mean “Read the next text character from P” The arrows are called the success links and the failure links respectively. 例：P489 KMP流图 1、与本科教材内容之间的联系 fail[k]=max{ l |0=lk 且p[1..l-1]是p[1..k-1]的后缀} 最大缀长度+1 * * 2、求ABABABCB的fail[] 3、P492流图 next[q]=max{ l |0=lq-1 且p[0..l-1]是p[0..q-1]的后缀} 最大缀长度 * * * * *