Expression on the truth table

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

Back to the table of contents
Alterna chapter 17 page 17.2
Expression on the truth table
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
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 и нажми «Построить СДНФ».