CNP: a consistent normal form

Содержание и основные понятия

Back to the table of contents
Alterna · Chapter 28 · page 28.2
CNP: a consistent normal form
Macsterms, the CNF designer for the truth table.
KNF
- it's the condition of the disunctions of the literals.
The mackerel.
. The CNP reads: "F=1, only if
All
The macsters are true."
GEF
PIF
EEG No. 2
He's got a little bit of depth.
Relationship to the previous one.
B
28.1 "DNF"
We've taken out the audio form through the mortars, and the KNF is its "duplicate": it's built on strings F=0 through the maststers.
01
What is a KNF?
KNF
(conjunctive normal shape) is the formula of the species:
F = (D₁) ∧ (D₂) ∧ … ∧ (Dₙ)
Where everyone
Dᵢ
- Literal dissunction.
Examples of NFCs:
F = (A∨¬B) ∧ (¬A∨C)
- Two-instance KNF
F = A ∧ B ∧ C
- single variable NFR (accident)
F = (A∨B∨C)
- A single dissunction KNF
F = (A∧B) ∨ C
- NON-CNF: from above the disjunction with internal conditions
Symmetry of NDF and KNF:
DPF
♪ ♪ [♪] the literarys ♪
rows F=1 * minterms
KNF
♪ ♪ [♪] the literarys ♪
rows F=0 x maxermes
02
Macsterms
Macsterm.
- a dissunction that includes
All
variable functions (every single time).
For F(A,B,C)
A=1, B=0, C=1
:
¬A ∨ B ∨ ¬C
Rule: variable
c V
if its value is = 1,
without B
If = 0. (Averse mintherma!)
A
B
C
Macsterm.
Symbol
0
0
0
A∨B∨C
M₀
0
0
1
A∨B∨¬C
M₁
0
1
0
A∨¬B∨C
M₂
0
1
1
A∨¬B∨¬C
M₃
1
0
0
¬A∨B∨C
M₄
1
0
1
¬A∨B∨¬C
M₅
1
1
0
¬A∨¬B∨C
M₆
1
1
1
¬A∨¬B∨¬C
M₇
Note: A macster for the ABC set is
Minterm denial
For the same set (de Morgan).
03
CNP Designer
🔨
Build a NFP on the truth table.
Select the variables and tick the lines where F=
0
Press "Construe KNF".
Pec:
Отметь строки (F=0) и нажми «Построить КНФ».
04
Comparison: NRF v CNP
⚖️
One function — Two Forms
Ask for an arbitrary function from three variables: see her NDF and CNP simultaneously.
Values F (8 bits, left = string 000):
ДНФ появится здесь
КНФ появится здесь
🎯
Mini-test: 5 KNF questions
XP: 0
🧩
KNF test
Five questions, 20 XP for every correct answer.