← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

32 第32章 字符串匹配

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.765Z

how to construct the string-matching automaton for a given input pattern. Finite automata

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 ∑ =

{a, b}. (a) A tabular representation of the transition function δ. (b) An equivalent stat

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter032.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea