原书出处
Introduction to Algorithms, Fourth Edition
32 第32章 字符串匹配
led the suffix function corresponding to the pattern P. The function σ maps ∑* to {0, 1, …
, m} such that σ(x) is the length of the longest prefix of P that is also a suffix of x: Figure 32.6 (a) A state-transition diagram for the string-matching automaton that accepts all strings ending in the string ababaca. State 0 is the start state, and state 7 (in orange) is the only accepting state. The transition function δ is defined by equation (32.4), and a directed edge from state i to state j labeled a represents δ(i, a) = j. The right-going
edges forming the “spine” of the automaton, shown in blue, correspond to successful match
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter032.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea