Theory of computation 学习笔记(Monash FIT2014)
声明
笔记内容来源于 monash university FIT2014 课程内容
仅供学习交流
Conjunctive Normal Form
在布尔逻辑中,如果一个公式是子句的合取,那么它是合取范式(CNF)的。
即,多个表达式的交集(∩)。
例: (B ∨ C ∨ T) ∧ (¬B ∨ ¬C) ∧ (¬B ∨ ¬T) ∧ (¬C ∨ ¬T)
predicate logic
In mathematical logic, a predicate is commonly understood to be a Boolean-valued function .
P: X→ {true, false}, called the predicate on X.
例:∀X : computer(X) ⇐⇒ automatic(X) ∧ programmable(X) ∧ storedProgram(X) ∧ generalPurpose(X)
这句表达式的意义为:对于任意计算机, 当且仅当它同时满足,是自动机,可被运行,可存储运行,能运算所有可计算问题,它被称为计算机。
induction
数学归纳法
证明步骤:
(i) Inductive basis:
(ii) Our inductive hypothesis is that …… is true for n. We need to use this to show that n can be replaced by n + 1 in this inequality
So, we’ve shown that, if the claimed inequality holds for n, then it holds for n + 1
(iii) By the Principle of Mathematical Induction, the claimed inequality must hold for all n.
即:
- 先列出base case, 例如对于n>=1的问题, n=1就是base case。
- 假设n=k时,成立
用1和2证明k+1时仍成立 - 得出结论,原式正确。
Regular expression
证明一个语言不是正则:
Pumping Lemma :
Then for all words w in L with more than N letters,
there exist strings x, y, z, with y ≠ ε, such that
◦ w = xyz
◦ length(x) + length(y) £ N
◦ for al