知识卡片

普通读书笔记卡 · 3706.a

接受态判定已读前缀是否匹配

理解等级:初级

自动机从q₀开始逐字符转移;读完前缀w后的状态记为φ(w),φ(ε)=q₀且φ(wa)=δ(φ(w),a)。当φ(w)属于接受态集合A时,已读的w被接受;每读一字即可判断当前前缀。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • 第32章 字符串匹配 · 查看原书依据

      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

    参考来源

    - 位置:《算法导论(第4版)》第32章《字符串匹配》(OEBPS/chapter032.xhtml,文本字符[20000,25000))。 - 结论依据:原文第32.2–32.3节对应算法、定义或复杂度说明;公式与示意图已核对。 - 原始内容:The finite automaton begins in state q 0 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