← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

32 第32章 字符串匹配

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.766Z

q′ + 1] = P[1] = a, and line 7 moves the automaton to the new state q′ + 1 = 1 = δ(5, a).

Thus, the intuition is that KMP-MATCHER iterates through the states in π*[q] in decreasing order, stopping at some state q′ and then possibly moving to state q′+1. Although that might seem like a lot of work just to simulate computing δ(q, a), bear in mind that asymptotically, KMP-MATCHER is no slower than FINITE-AUTOMATON-MATCHER. We are now ready to formally prove the correctness of the Knuth-Morris-Pratt algorithm. By Theorem 32.4, we have that q = σ(T[:i]) after each time line 3 of FINITE-AUTOMATON-MATCHER executes. Therefore, it suffices to show that the same

property holds with regard to the for loop in KMP-MATCHER. The proof proceeds by inductio

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter032.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea