知识卡片
有限自动机由五元组定义
有限自动机由状态集合Q、初态q₀、接受态集合A、输入字母表Σ和转移函数δ组成。δ根据当前状态与下一个字符给出新状态;状态数有限,因而可把已经读过的前缀压缩为当前状态。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第32章 字符串匹配 · 查看原书依据
A finite automaton M, illustrated in Figure 32.5, is a 5-tuple (Q, q0, A, ∑, δ), where Q is a finite set of states, q0 ∈ Q is the start state, A ⊆ Q is a distinguished set of accepting states, ∑ is a finite input alphabet, δ is a function from Q × ∑ into Q, called the transition function of M. Figure 32.5 A simple two-state finite automaton with state set Q = {0, 1}, start state q0 = 0, and input alphabet ∑ =
参考来源
- 位置:《算法导论(第4版)》第32章《字符串匹配》(OEBPS/chapter032.xhtml,文本字符[20000,25000))。
- 结论依据:原文第32.2–32.3节对应算法、定义或复杂度说明;公式与示意图已核对。
- 原始内容:A finite automaton M , illustrated in Figure 32.5 , is a 5-tuple ( Q , q 0 , A , ∑, δ ), where Q is a finite set of states , q 0 ∈ Q is the start state , A ⊆ Q is a distinguished set of accepting states , ∑ is a finite input alphabet , δ is a function from Q × ∑ into Q , called the transition function of M . Figure 32.5 A simple two-state finite automaton with state set Q = {0, 1}, start state q 0 = 0, and input alphabet ∑ =