原书出处
Introduction to Algorithms, Fourth Edition
32 第32章 字符串匹配
matching automaton that corresponds to a given pattern P[1:m]: The state set Q is {0, 1, …
, m}. The start state q0 is state 0, and state m is the only accepting state. The transition function δ is defined, for any state q and character a, by As the automaton consumes characters of the text T, it is trying to build a match of the pattern P against the most recently seen characters of T. At any time, the state number q gives the length of the longest prefix of P that matches the most recently seen text characters. Whenever the automaton reaches state m, the m most
recently seen text characters match the first m characters of P. Since P has length m, re
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter032.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea