原书出处
Introduction to Algorithms, Fourth Edition
32 第32章 字符串匹配
abbaa, it enters the sequence of states 〈0, 1, 0, 0, 1, 0〉, and so it rejects this input.
The finite automaton begins in state q0 and reads the characters of its input string one at a time. If the automaton is in state q and reads input character a, it moves (“makes a transition”) from state q to state δ(q, a). Whenever its current state q is a member of A, the machine M has accepted the string read so far. An input that is not accepted is rejected. A finite automaton M induces a function ϕ, called the final-state function, from ∑* to Q such that ϕ(w) is the state M ends up in after
reading the string w. Thus, M accepts a string w if and only if ϕ(w) ∈ A. We define the f
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter032.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea