NPF and Carno maps: from table to formula

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

Back to the table of contents
Alterna · Chapter 18 · page 18.2
NPF and Carno maps: from table to formula
Knock on line F=1 is a program that will build the formula.
NDLF
The EEG No. 2 often gives a table and asks for the construction of the NSF.
GEF
PIF
EEG No. 2.15
▪ Communication with Chapter 17
Logical Functions
System reliability
Each valve is a knot of a row with a boulder value. The truth table is a private case of a cyclic graph.
00
Model examples
Minterm
A ∧ B
Context
1
If A=1, B=1 ♪ Minerm is true
Three-string JNDF
¬A∧B
A∧¬B
A∧B
∨
NDLF
Three minthers connected by disuncture
Carno map 2×2
00
01
11
10
A↓B→
A→B↓
The grouping of adjacent cells gives the impliant
SNCF - Macsterm Discussion
A ∨ ¬B
Macsterm.
¬A ∨ B
Macsterm.
∧
SNCF
Macsterm conditions = SNCF
01
JNDF construction algorithm
Find all rows of the table where
F = 1
.
For each line, write
the status of all variables
:
If the variable in this line is equal to 1, we write it as it is.
If = 0, write it with denial (B).
All situations obtained shall be connected through
disunction ♪
.
Example
In the table (A, B, F): (0.1), (1.0.1), (1.1.1) is the three lines with F=1.
Minterms:
(¬A∧B)
,
(A∧¬B)
,
(A∧B)
.
JUNE:
(¬A∧B)∨(A∧¬B)∨(A∧B)
.
02
FCN (for completeness)
Find all the lines where
F = 0
.
For each record
Dizuntion of variables
(If 0 is without denial, if 1 is with denial).
Connect via
situation ♪
.
For the same example (A, B, F): F = 0 in the row only (0.0.0).
(A∨B)
.
03
Interactive JNDF builder
Scream on strings where F=1
🔨
SNDF builder:
Number of variables
Выбери строки с F=1 и нажми «Построить СДНФ».
04
Carno map
Visual simplification: cell clicks F=1 * map will show groups and simplified shape
🗺
Carno map (GEP No. 15)
Pe.
Clip the cell where F=1, then press "Simplify."
05
Mini test
:: NUFF and Carno maps
🔥
0
Question 1 out of 5
0
XP
Ur:
Newcomer
·
50
XP