知识卡片
Kleene星号允许零次连接
语言L的连接L₁L₂由两个语言中的字符串依次拼接形成。
Kleene星号L*包含零次、一次及任意多次连接的结果,零次对应空串ε;别把空串与空语言Ø混同。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第34章 NP完全性 · 查看原书依据
, where Lk is the language obtained by concatenating L to itself k times. From the point of view of language theory, the set of instances for any decision problem Q is simply the set Σ*, where Σ = {0, 1}. Since Q is entirely characterized by those problem instances that produce a 1 (yes)
参考来源
- 位置:《算法导论(第4版)》第34章《NP完全性》(OEBPS/chapter034.xhtml,文本字符[25000,30000))。
- 结论依据:原文§34.1–34.2的编码、形式语言、验证定义及证明;章末练习不作已解结论。
- 原始内容:The concatenation L 1 L 2 of two languages L 1 and L 2 is the language L = { x 1 x 2 : x 1 ∈ L 1 and x 2 ∈ L 2 }. The closure or Kleene star of a language L is the language L * = { ε } ∪ L ∪ L 2 ∪ L 3 ∪ …, where L k is the language obtained by concatenating L to itself k times. From the point of view of language theory, the set of instances for any decision problem Q is simply the set Σ*, where Σ = {0, 1}. Since Q is entirely characterized by those problem instances that produce a 1 (yes)