Промежуточные таблицы истинности:¬H:
E∧(¬H):
E | H | ¬H | E∧(¬H) |
0 | 0 | 1 | 0 |
0 | 1 | 0 | 0 |
1 | 0 | 1 | 1 |
1 | 1 | 0 | 0 |
(E∧(¬H))∧X:
E | H | X | ¬H | E∧(¬H) | (E∧(¬H))∧X |
0 | 0 | 0 | 1 | 0 | 0 |
0 | 0 | 1 | 1 | 0 | 0 |
0 | 1 | 0 | 0 | 0 | 0 |
0 | 1 | 1 | 0 | 0 | 0 |
1 | 0 | 0 | 1 | 1 | 0 |
1 | 0 | 1 | 1 | 1 | 1 |
1 | 1 | 0 | 0 | 0 | 0 |
1 | 1 | 1 | 0 | 0 | 0 |
H∨X:
(H∨X)∨Z:
H | X | Z | H∨X | (H∨X)∨Z |
0 | 0 | 0 | 0 | 0 |
0 | 0 | 1 | 0 | 1 |
0 | 1 | 0 | 1 | 1 |
0 | 1 | 1 | 1 | 1 |
1 | 0 | 0 | 1 | 1 |
1 | 0 | 1 | 1 | 1 |
1 | 1 | 0 | 1 | 1 |
1 | 1 | 1 | 1 | 1 |
E|H:
¬((H∨X)∨Z):
H | X | Z | H∨X | (H∨X)∨Z | ¬((H∨X)∨Z) |
0 | 0 | 0 | 0 | 0 | 1 |
0 | 0 | 1 | 0 | 1 | 0 |
0 | 1 | 0 | 1 | 1 | 0 |
0 | 1 | 1 | 1 | 1 | 0 |
1 | 0 | 0 | 1 | 1 | 0 |
1 | 0 | 1 | 1 | 1 | 0 |
1 | 1 | 0 | 1 | 1 | 0 |
1 | 1 | 1 | 1 | 1 | 0 |
(¬((H∨X)∨Z))∧(E|H):
H | X | Z | E | H∨X | (H∨X)∨Z | ¬((H∨X)∨Z) | E|H | (¬((H∨X)∨Z))∧(E|H) |
0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 |
0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 |
0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 0 |
0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 |
0 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 |
0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 |
0 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 |
0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 0 |
1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 |
1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 |
1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 |
1 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 |
1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 |
1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 0 |
1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 |
1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 |
¬X:
(¬X)↓Z:
X | Z | ¬X | (¬X)↓Z |
0 | 0 | 1 | 0 |
0 | 1 | 1 | 0 |
1 | 0 | 0 | 1 |
1 | 1 | 0 | 0 |
¬((E∧(¬H))∧X):
E | H | X | ¬H | E∧(¬H) | (E∧(¬H))∧X | ¬((E∧(¬H))∧X) |
0 | 0 | 0 | 1 | 0 | 0 | 1 |
0 | 0 | 1 | 1 | 0 | 0 | 1 |
0 | 1 | 0 | 0 | 0 | 0 | 1 |
0 | 1 | 1 | 0 | 0 | 0 | 1 |
1 | 0 | 0 | 1 | 1 | 0 | 1 |
1 | 0 | 1 | 1 | 1 | 1 | 0 |
1 | 1 | 0 | 0 | 0 | 0 | 1 |
1 | 1 | 1 | 0 | 0 | 0 | 1 |
((¬((H∨X)∨Z))∧(E|H))∨((¬X)↓Z):
H | X | Z | E | H∨X | (H∨X)∨Z | ¬((H∨X)∨Z) | E|H | (¬((H∨X)∨Z))∧(E|H) | ¬X | (¬X)↓Z | ((¬((H∨X)∨Z))∧(E|H))∨((¬X)↓Z) |
0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 |
0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 |
0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 |
0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 |
0 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 |
0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 |
0 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 |
0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 |
1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 0 |
1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 |
1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 0 |
1 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 |
1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 |
1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 |
1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 |
1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
(¬((E∧(¬H))∧X))→(((¬((H∨X)∨Z))∧(E|H))∨((¬X)↓Z)):
E | H | X | Z | ¬H | E∧(¬H) | (E∧(¬H))∧X | ¬((E∧(¬H))∧X) | H∨X | (H∨X)∨Z | ¬((H∨X)∨Z) | E|H | (¬((H∨X)∨Z))∧(E|H) | ¬X | (¬X)↓Z | ((¬((H∨X)∨Z))∧(E|H))∨((¬X)↓Z) | (¬((E∧(¬H))∧X))→(((¬((H∨X)∨Z))∧(E|H))∨((¬X)↓Z)) |
0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 |
0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 |
0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 |
0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 |
0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 |
0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 |
0 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 |
1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 |
1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 |
1 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 |
1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 1 |
1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 |
1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
Общая таблица истинности:
E | H | X | Z | ¬H | E∧(¬H) | (E∧(¬H))∧X | H∨X | (H∨X)∨Z | E|H | ¬((H∨X)∨Z) | (¬((H∨X)∨Z))∧(E|H) | ¬X | (¬X)↓Z | ¬((E∧(¬H))∧X) | ((¬((H∨X)∨Z))∧(E|H))∨((¬X)↓Z) | ¬(E∧¬H∧X)→(¬(H∨X∨Z)∧(E|H))∨(¬X↓Z) |
0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 |
0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 |
0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 |
0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 |
0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 |
0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 |
0 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 |
1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 |
1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 1 |
1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 |
1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 |
1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 |
1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
Логическая схема:
Совершенная дизъюнктивная нормальная форма (СДНФ):
По таблице истинности:
E | H | X | Z | F |
0 | 0 | 0 | 0 | 1 |
0 | 0 | 0 | 1 | 0 |
0 | 0 | 1 | 0 | 1 |
0 | 0 | 1 | 1 | 0 |
0 | 1 | 0 | 0 | 0 |
0 | 1 | 0 | 1 | 0 |
0 | 1 | 1 | 0 | 1 |
0 | 1 | 1 | 1 | 0 |
1 | 0 | 0 | 0 | 1 |
1 | 0 | 0 | 1 | 0 |
1 | 0 | 1 | 0 | 1 |
1 | 0 | 1 | 1 | 1 |
1 | 1 | 0 | 0 | 0 |
1 | 1 | 0 | 1 | 0 |
1 | 1 | 1 | 0 | 1 |
1 | 1 | 1 | 1 | 0 |
F
сднф = ¬E∧¬H∧¬X∧¬Z ∨ ¬E∧¬H∧X∧¬Z ∨ ¬E∧H∧X∧¬Z ∨ E∧¬H∧¬X∧¬Z ∨ E∧¬H∧X∧¬Z ∨ E∧¬H∧X∧Z ∨ E∧H∧X∧¬Z
Логическая cхема:
Совершенная конъюнктивная нормальная форма (СКНФ):
По таблице истинности:
E | H | X | Z | F |
0 | 0 | 0 | 0 | 1 |
0 | 0 | 0 | 1 | 0 |
0 | 0 | 1 | 0 | 1 |
0 | 0 | 1 | 1 | 0 |
0 | 1 | 0 | 0 | 0 |
0 | 1 | 0 | 1 | 0 |
0 | 1 | 1 | 0 | 1 |
0 | 1 | 1 | 1 | 0 |
1 | 0 | 0 | 0 | 1 |
1 | 0 | 0 | 1 | 0 |
1 | 0 | 1 | 0 | 1 |
1 | 0 | 1 | 1 | 1 |
1 | 1 | 0 | 0 | 0 |
1 | 1 | 0 | 1 | 0 |
1 | 1 | 1 | 0 | 1 |
1 | 1 | 1 | 1 | 0 |
F
скнф = (E∨H∨X∨¬Z) ∧ (E∨H∨¬X∨¬Z) ∧ (E∨¬H∨X∨Z) ∧ (E∨¬H∨X∨¬Z) ∧ (E∨¬H∨¬X∨¬Z) ∧ (¬E∨H∨X∨¬Z) ∧ (¬E∨¬H∨X∨Z) ∧ (¬E∨¬H∨X∨¬Z) ∧ (¬E∨¬H∨¬X∨¬Z)
Логическая cхема:
Построение полинома Жегалкина:
По таблице истинности функции
E | H | X | Z | Fж |
0 | 0 | 0 | 0 | 1 |
0 | 0 | 0 | 1 | 0 |
0 | 0 | 1 | 0 | 1 |
0 | 0 | 1 | 1 | 0 |
0 | 1 | 0 | 0 | 0 |
0 | 1 | 0 | 1 | 0 |
0 | 1 | 1 | 0 | 1 |
0 | 1 | 1 | 1 | 0 |
1 | 0 | 0 | 0 | 1 |
1 | 0 | 0 | 1 | 0 |
1 | 0 | 1 | 0 | 1 |
1 | 0 | 1 | 1 | 1 |
1 | 1 | 0 | 0 | 0 |
1 | 1 | 0 | 1 | 0 |
1 | 1 | 1 | 0 | 1 |
1 | 1 | 1 | 1 | 0 |
Построим полином Жегалкина:
F
ж = C
0000 ⊕ C
1000∧E ⊕ C
0100∧H ⊕ C
0010∧X ⊕ C
0001∧Z ⊕ C
1100∧E∧H ⊕ C
1010∧E∧X ⊕ C
1001∧E∧Z ⊕ C
0110∧H∧X ⊕ C
0101∧H∧Z ⊕ C
0011∧X∧Z ⊕ C
1110∧E∧H∧X ⊕ C
1101∧E∧H∧Z ⊕ C
1011∧E∧X∧Z ⊕ C
0111∧H∧X∧Z ⊕ C
1111∧E∧H∧X∧Z
Так как F
ж(0000) = 1, то С
0000 = 1.
Далее подставляем все остальные наборы в порядке возрастания числа единиц, подставляя вновь полученные значения в следующие формулы:
F
ж(1000) = С
0000 ⊕ С
1000 = 1 => С
1000 = 1 ⊕ 1 = 0
F
ж(0100) = С
0000 ⊕ С
0100 = 0 => С
0100 = 1 ⊕ 0 = 1
F
ж(0010) = С
0000 ⊕ С
0010 = 1 => С
0010 = 1 ⊕ 1 = 0
F
ж(0001) = С
0000 ⊕ С
0001 = 0 => С
0001 = 1 ⊕ 0 = 1
F
ж(1100) = С
0000 ⊕ С
1000 ⊕ С
0100 ⊕ С
1100 = 0 => С
1100 = 1 ⊕ 0 ⊕ 1 ⊕ 0 = 0
F
ж(1010) = С
0000 ⊕ С
1000 ⊕ С
0010 ⊕ С
1010 = 1 => С
1010 = 1 ⊕ 0 ⊕ 0 ⊕ 1 = 0
F
ж(1001) = С
0000 ⊕ С
1000 ⊕ С
0001 ⊕ С
1001 = 0 => С
1001 = 1 ⊕ 0 ⊕ 1 ⊕ 0 = 0
F
ж(0110) = С
0000 ⊕ С
0100 ⊕ С
0010 ⊕ С
0110 = 1 => С
0110 = 1 ⊕ 1 ⊕ 0 ⊕ 1 = 1
F
ж(0101) = С
0000 ⊕ С
0100 ⊕ С
0001 ⊕ С
0101 = 0 => С
0101 = 1 ⊕ 1 ⊕ 1 ⊕ 0 = 1
F
ж(0011) = С
0000 ⊕ С
0010 ⊕ С
0001 ⊕ С
0011 = 0 => С
0011 = 1 ⊕ 0 ⊕ 1 ⊕ 0 = 0
F
ж(1110) = С
0000 ⊕ С
1000 ⊕ С
0100 ⊕ С
0010 ⊕ С
1100 ⊕ С
1010 ⊕ С
0110 ⊕ С
1110 = 1 => С
1110 = 1 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 1 = 0
F
ж(1101) = С
0000 ⊕ С
1000 ⊕ С
0100 ⊕ С
0001 ⊕ С
1100 ⊕ С
1001 ⊕ С
0101 ⊕ С
1101 = 0 => С
1101 = 1 ⊕ 0 ⊕ 1 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 = 0
F
ж(1011) = С
0000 ⊕ С
1000 ⊕ С
0010 ⊕ С
0001 ⊕ С
1010 ⊕ С
1001 ⊕ С
0011 ⊕ С
1011 = 1 => С
1011 = 1 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 = 1
F
ж(0111) = С
0000 ⊕ С
0100 ⊕ С
0010 ⊕ С
0001 ⊕ С
0110 ⊕ С
0101 ⊕ С
0011 ⊕ С
0111 = 0 => С
0111 = 1 ⊕ 1 ⊕ 0 ⊕ 1 ⊕ 1 ⊕ 1 ⊕ 0 ⊕ 0 = 1
F
ж(1111) = С
0000 ⊕ С
1000 ⊕ С
0100 ⊕ С
0010 ⊕ С
0001 ⊕ С
1100 ⊕ С
1010 ⊕ С
1001 ⊕ С
0110 ⊕ С
0101 ⊕ С
0011 ⊕ С
1110 ⊕ С
1101 ⊕ С
1011 ⊕ С
0111 ⊕ С
1111 = 0 => С
1111 = 1 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 1 ⊕ 0 = 1
Таким образом, полином Жегалкина будет равен:
F
ж = 1 ⊕ H ⊕ Z ⊕ H∧X ⊕ H∧Z ⊕ E∧X∧Z ⊕ H∧X∧Z ⊕ E∧H∧X∧Z
Логическая схема, соответствующая полиному Жегалкина: