原书出处
Introduction to Algorithms, Fourth Edition
32 第32章 字符串匹配
ate set Q is {0, 1, …, m}, the start state is 0, and the only accepting state is state m.
From the simple loop structure of FINITE-AUTOMATON-MATCHER, you can see that its matching time on a text string of length n is Θ(n), assuming that each lookup of the transition function δ takes constant time. This matching time, however, does not include the preprocessing time required to compute the transition function. We address this problem later, after first proving that the procedure FINITE-AUTOMATON-MATCHER operates
correctly. FINITE-AUTOMATON-MATCHER(T, δ, n, m) 1 q = 0 2 for i = 1 to n 3 q = δ(q, T[i])
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter032.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea