Промежуточные таблицы истинности:X∨Y:
X∨Z:
Y∨Z:
A∧F:
(X∨Y)∧(X∨Z):
X | Y | Z | X∨Y | X∨Z | (X∨Y)∧(X∨Z) |
0 | 0 | 0 | 0 | 0 | 0 |
0 | 0 | 1 | 0 | 1 | 0 |
0 | 1 | 0 | 1 | 0 | 0 |
0 | 1 | 1 | 1 | 1 | 1 |
1 | 0 | 0 | 1 | 1 | 1 |
1 | 0 | 1 | 1 | 1 | 1 |
1 | 1 | 0 | 1 | 1 | 1 |
1 | 1 | 1 | 1 | 1 | 1 |
((X∨Y)∧(X∨Z))∧(Y∨Z):
X | Y | Z | X∨Y | X∨Z | (X∨Y)∧(X∨Z) | Y∨Z | ((X∨Y)∧(X∨Z))∧(Y∨Z) |
0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
0 | 0 | 1 | 0 | 1 | 0 | 1 | 0 |
0 | 1 | 0 | 1 | 0 | 0 | 1 | 0 |
0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 |
1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 |
1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
(A∧F)≡(((X∨Y)∧(X∨Z))∧(Y∨Z)):
A | F | X | Y | Z | A∧F | X∨Y | X∨Z | (X∨Y)∧(X∨Z) | Y∨Z | ((X∨Y)∧(X∨Z))∧(Y∨Z) | (A∧F)≡(((X∨Y)∧(X∨Z))∧(Y∨Z)) |
0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 |
0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 |
0 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 |
0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 |
0 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 |
0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 |
0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 |
0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
0 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 |
0 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 |
0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 |
0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 |
0 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 |
0 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 |
0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 |
1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 |
1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 |
1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 |
1 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 |
1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 |
1 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 |
1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 |
1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 0 |
1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 |
1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 |
1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
Общая таблица истинности:
A | F | X | Y | Z | X∨Y | X∨Z | Y∨Z | A∧F | (X∨Y)∧(X∨Z) | ((X∨Y)∧(X∨Z))∧(Y∨Z) | A∧F≡(X∨Y)∧(X∨Z)∧(Y∨Z) |
0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 1 |
0 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 |
0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 |
0 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 |
0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 |
0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 |
0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 |
0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 1 |
0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 |
0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 |
0 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 |
0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 |
0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 |
0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 |
1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
1 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 1 |
1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 |
1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 |
1 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 |
1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 |
1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 |
1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 |
1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 0 |
1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 0 |
1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 0 |
1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
Логическая схема:
Совершенная дизъюнктивная нормальная форма (СДНФ):
По таблице истинности:
A | F | X | Y | Z | F |
0 | 0 | 0 | 0 | 0 | 1 |
0 | 0 | 0 | 0 | 1 | 1 |
0 | 0 | 0 | 1 | 0 | 1 |
0 | 0 | 0 | 1 | 1 | 0 |
0 | 0 | 1 | 0 | 0 | 1 |
0 | 0 | 1 | 0 | 1 | 0 |
0 | 0 | 1 | 1 | 0 | 0 |
0 | 0 | 1 | 1 | 1 | 0 |
0 | 1 | 0 | 0 | 0 | 1 |
0 | 1 | 0 | 0 | 1 | 1 |
0 | 1 | 0 | 1 | 0 | 1 |
0 | 1 | 0 | 1 | 1 | 0 |
0 | 1 | 1 | 0 | 0 | 1 |
0 | 1 | 1 | 0 | 1 | 0 |
0 | 1 | 1 | 1 | 0 | 0 |
0 | 1 | 1 | 1 | 1 | 0 |
1 | 0 | 0 | 0 | 0 | 1 |
1 | 0 | 0 | 0 | 1 | 1 |
1 | 0 | 0 | 1 | 0 | 1 |
1 | 0 | 0 | 1 | 1 | 0 |
1 | 0 | 1 | 0 | 0 | 1 |
1 | 0 | 1 | 0 | 1 | 0 |
1 | 0 | 1 | 1 | 0 | 0 |
1 | 0 | 1 | 1 | 1 | 0 |
1 | 1 | 0 | 0 | 0 | 0 |
1 | 1 | 0 | 0 | 1 | 0 |
1 | 1 | 0 | 1 | 0 | 0 |
1 | 1 | 0 | 1 | 1 | 1 |
1 | 1 | 1 | 0 | 0 | 0 |
1 | 1 | 1 | 0 | 1 | 1 |
1 | 1 | 1 | 1 | 0 | 1 |
1 | 1 | 1 | 1 | 1 | 1 |
F
сднф = ¬A∧¬F∧¬X∧¬Y∧¬Z ∨ ¬A∧¬F∧¬X∧¬Y∧Z ∨ ¬A∧¬F∧¬X∧Y∧¬Z ∨ ¬A∧¬F∧X∧¬Y∧¬Z ∨ ¬A∧F∧¬X∧¬Y∧¬Z ∨ ¬A∧F∧¬X∧¬Y∧Z ∨ ¬A∧F∧¬X∧Y∧¬Z ∨ ¬A∧F∧X∧¬Y∧¬Z ∨ A∧¬F∧¬X∧¬Y∧¬Z ∨ A∧¬F∧¬X∧¬Y∧Z ∨ A∧¬F∧¬X∧Y∧¬Z ∨ A∧¬F∧X∧¬Y∧¬Z ∨ A∧F∧¬X∧Y∧Z ∨ A∧F∧X∧¬Y∧Z ∨ A∧F∧X∧Y∧¬Z ∨ A∧F∧X∧Y∧Z
Логическая cхема:
Совершенная конъюнктивная нормальная форма (СКНФ):
По таблице истинности:
A | F | X | Y | Z | F |
0 | 0 | 0 | 0 | 0 | 1 |
0 | 0 | 0 | 0 | 1 | 1 |
0 | 0 | 0 | 1 | 0 | 1 |
0 | 0 | 0 | 1 | 1 | 0 |
0 | 0 | 1 | 0 | 0 | 1 |
0 | 0 | 1 | 0 | 1 | 0 |
0 | 0 | 1 | 1 | 0 | 0 |
0 | 0 | 1 | 1 | 1 | 0 |
0 | 1 | 0 | 0 | 0 | 1 |
0 | 1 | 0 | 0 | 1 | 1 |
0 | 1 | 0 | 1 | 0 | 1 |
0 | 1 | 0 | 1 | 1 | 0 |
0 | 1 | 1 | 0 | 0 | 1 |
0 | 1 | 1 | 0 | 1 | 0 |
0 | 1 | 1 | 1 | 0 | 0 |
0 | 1 | 1 | 1 | 1 | 0 |
1 | 0 | 0 | 0 | 0 | 1 |
1 | 0 | 0 | 0 | 1 | 1 |
1 | 0 | 0 | 1 | 0 | 1 |
1 | 0 | 0 | 1 | 1 | 0 |
1 | 0 | 1 | 0 | 0 | 1 |
1 | 0 | 1 | 0 | 1 | 0 |
1 | 0 | 1 | 1 | 0 | 0 |
1 | 0 | 1 | 1 | 1 | 0 |
1 | 1 | 0 | 0 | 0 | 0 |
1 | 1 | 0 | 0 | 1 | 0 |
1 | 1 | 0 | 1 | 0 | 0 |
1 | 1 | 0 | 1 | 1 | 1 |
1 | 1 | 1 | 0 | 0 | 0 |
1 | 1 | 1 | 0 | 1 | 1 |
1 | 1 | 1 | 1 | 0 | 1 |
1 | 1 | 1 | 1 | 1 | 1 |
F
скнф = (A∨F∨X∨¬Y∨¬Z) ∧ (A∨F∨¬X∨Y∨¬Z) ∧ (A∨F∨¬X∨¬Y∨Z) ∧ (A∨F∨¬X∨¬Y∨¬Z) ∧ (A∨¬F∨X∨¬Y∨¬Z) ∧ (A∨¬F∨¬X∨Y∨¬Z) ∧ (A∨¬F∨¬X∨¬Y∨Z) ∧ (A∨¬F∨¬X∨¬Y∨¬Z) ∧ (¬A∨F∨X∨¬Y∨¬Z) ∧ (¬A∨F∨¬X∨Y∨¬Z) ∧ (¬A∨F∨¬X∨¬Y∨Z) ∧ (¬A∨F∨¬X∨¬Y∨¬Z) ∧ (¬A∨¬F∨X∨Y∨Z) ∧ (¬A∨¬F∨X∨Y∨¬Z) ∧ (¬A∨¬F∨X∨¬Y∨Z) ∧ (¬A∨¬F∨¬X∨Y∨Z)
Логическая cхема:
Построение полинома Жегалкина:
По таблице истинности функции
A | F | X | Y | Z | Fж |
0 | 0 | 0 | 0 | 0 | 1 |
0 | 0 | 0 | 0 | 1 | 1 |
0 | 0 | 0 | 1 | 0 | 1 |
0 | 0 | 0 | 1 | 1 | 0 |
0 | 0 | 1 | 0 | 0 | 1 |
0 | 0 | 1 | 0 | 1 | 0 |
0 | 0 | 1 | 1 | 0 | 0 |
0 | 0 | 1 | 1 | 1 | 0 |
0 | 1 | 0 | 0 | 0 | 1 |
0 | 1 | 0 | 0 | 1 | 1 |
0 | 1 | 0 | 1 | 0 | 1 |
0 | 1 | 0 | 1 | 1 | 0 |
0 | 1 | 1 | 0 | 0 | 1 |
0 | 1 | 1 | 0 | 1 | 0 |
0 | 1 | 1 | 1 | 0 | 0 |
0 | 1 | 1 | 1 | 1 | 0 |
1 | 0 | 0 | 0 | 0 | 1 |
1 | 0 | 0 | 0 | 1 | 1 |
1 | 0 | 0 | 1 | 0 | 1 |
1 | 0 | 0 | 1 | 1 | 0 |
1 | 0 | 1 | 0 | 0 | 1 |
1 | 0 | 1 | 0 | 1 | 0 |
1 | 0 | 1 | 1 | 0 | 0 |
1 | 0 | 1 | 1 | 1 | 0 |
1 | 1 | 0 | 0 | 0 | 0 |
1 | 1 | 0 | 0 | 1 | 0 |
1 | 1 | 0 | 1 | 0 | 0 |
1 | 1 | 0 | 1 | 1 | 1 |
1 | 1 | 1 | 0 | 0 | 0 |
1 | 1 | 1 | 0 | 1 | 1 |
1 | 1 | 1 | 1 | 0 | 1 |
1 | 1 | 1 | 1 | 1 | 1 |
Построим полином Жегалкина:
F
ж = C
00000 ⊕ C
10000∧A ⊕ C
01000∧F ⊕ C
00100∧X ⊕ C
00010∧Y ⊕ C
00001∧Z ⊕ C
11000∧A∧F ⊕ C
10100∧A∧X ⊕ C
10010∧A∧Y ⊕ C
10001∧A∧Z ⊕ C
01100∧F∧X ⊕ C
01010∧F∧Y ⊕ C
01001∧F∧Z ⊕ C
00110∧X∧Y ⊕ C
00101∧X∧Z ⊕ C
00011∧Y∧Z ⊕ C
11100∧A∧F∧X ⊕ C
11010∧A∧F∧Y ⊕ C
11001∧A∧F∧Z ⊕ C
10110∧A∧X∧Y ⊕ C
10101∧A∧X∧Z ⊕ C
10011∧A∧Y∧Z ⊕ C
01110∧F∧X∧Y ⊕ C
01101∧F∧X∧Z ⊕ C
01011∧F∧Y∧Z ⊕ C
00111∧X∧Y∧Z ⊕ C
11110∧A∧F∧X∧Y ⊕ C
11101∧A∧F∧X∧Z ⊕ C
11011∧A∧F∧Y∧Z ⊕ C
10111∧A∧X∧Y∧Z ⊕ C
01111∧F∧X∧Y∧Z ⊕ C
11111∧A∧F∧X∧Y∧Z
Так как F
ж(00000) = 1, то С
00000 = 1.
Далее подставляем все остальные наборы в порядке возрастания числа единиц, подставляя вновь полученные значения в следующие формулы:
F
ж(10000) = С
00000 ⊕ С
10000 = 1 => С
10000 = 1 ⊕ 1 = 0
F
ж(01000) = С
00000 ⊕ С
01000 = 1 => С
01000 = 1 ⊕ 1 = 0
F
ж(00100) = С
00000 ⊕ С
00100 = 1 => С
00100 = 1 ⊕ 1 = 0
F
ж(00010) = С
00000 ⊕ С
00010 = 1 => С
00010 = 1 ⊕ 1 = 0
F
ж(00001) = С
00000 ⊕ С
00001 = 1 => С
00001 = 1 ⊕ 1 = 0
F
ж(11000) = С
00000 ⊕ С
10000 ⊕ С
01000 ⊕ С
11000 = 0 => С
11000 = 1 ⊕ 0 ⊕ 0 ⊕ 0 = 1
F
ж(10100) = С
00000 ⊕ С
10000 ⊕ С
00100 ⊕ С
10100 = 1 => С
10100 = 1 ⊕ 0 ⊕ 0 ⊕ 1 = 0
F
ж(10010) = С
00000 ⊕ С
10000 ⊕ С
00010 ⊕ С
10010 = 1 => С
10010 = 1 ⊕ 0 ⊕ 0 ⊕ 1 = 0
F
ж(10001) = С
00000 ⊕ С
10000 ⊕ С
00001 ⊕ С
10001 = 1 => С
10001 = 1 ⊕ 0 ⊕ 0 ⊕ 1 = 0
F
ж(01100) = С
00000 ⊕ С
01000 ⊕ С
00100 ⊕ С
01100 = 1 => С
01100 = 1 ⊕ 0 ⊕ 0 ⊕ 1 = 0
F
ж(01010) = С
00000 ⊕ С
01000 ⊕ С
00010 ⊕ С
01010 = 1 => С
01010 = 1 ⊕ 0 ⊕ 0 ⊕ 1 = 0
F
ж(01001) = С
00000 ⊕ С
01000 ⊕ С
00001 ⊕ С
01001 = 1 => С
01001 = 1 ⊕ 0 ⊕ 0 ⊕ 1 = 0
F
ж(00110) = С
00000 ⊕ С
00100 ⊕ С
00010 ⊕ С
00110 = 0 => С
00110 = 1 ⊕ 0 ⊕ 0 ⊕ 0 = 1
F
ж(00101) = С
00000 ⊕ С
00100 ⊕ С
00001 ⊕ С
00101 = 0 => С
00101 = 1 ⊕ 0 ⊕ 0 ⊕ 0 = 1
F
ж(00011) = С
00000 ⊕ С
00010 ⊕ С
00001 ⊕ С
00011 = 0 => С
00011 = 1 ⊕ 0 ⊕ 0 ⊕ 0 = 1
F
ж(11100) = С
00000 ⊕ С
10000 ⊕ С
01000 ⊕ С
00100 ⊕ С
11000 ⊕ С
10100 ⊕ С
01100 ⊕ С
11100 = 0 => С
11100 = 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 = 0
F
ж(11010) = С
00000 ⊕ С
10000 ⊕ С
01000 ⊕ С
00010 ⊕ С
11000 ⊕ С
10010 ⊕ С
01010 ⊕ С
11010 = 0 => С
11010 = 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 = 0
F
ж(11001) = С
00000 ⊕ С
10000 ⊕ С
01000 ⊕ С
00001 ⊕ С
11000 ⊕ С
10001 ⊕ С
01001 ⊕ С
11001 = 0 => С
11001 = 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 = 0
F
ж(10110) = С
00000 ⊕ С
10000 ⊕ С
00100 ⊕ С
00010 ⊕ С
10100 ⊕ С
10010 ⊕ С
00110 ⊕ С
10110 = 0 => С
10110 = 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 = 0
F
ж(10101) = С
00000 ⊕ С
10000 ⊕ С
00100 ⊕ С
00001 ⊕ С
10100 ⊕ С
10001 ⊕ С
00101 ⊕ С
10101 = 0 => С
10101 = 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 = 0
F
ж(10011) = С
00000 ⊕ С
10000 ⊕ С
00010 ⊕ С
00001 ⊕ С
10010 ⊕ С
10001 ⊕ С
00011 ⊕ С
10011 = 0 => С
10011 = 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 = 0
F
ж(01110) = С
00000 ⊕ С
01000 ⊕ С
00100 ⊕ С
00010 ⊕ С
01100 ⊕ С
01010 ⊕ С
00110 ⊕ С
01110 = 0 => С
01110 = 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 = 0
F
ж(01101) = С
00000 ⊕ С
01000 ⊕ С
00100 ⊕ С
00001 ⊕ С
01100 ⊕ С
01001 ⊕ С
00101 ⊕ С
01101 = 0 => С
01101 = 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 = 0
F
ж(01011) = С
00000 ⊕ С
01000 ⊕ С
00010 ⊕ С
00001 ⊕ С
01010 ⊕ С
01001 ⊕ С
00011 ⊕ С
01011 = 0 => С
01011 = 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 = 0
F
ж(00111) = С
00000 ⊕ С
00100 ⊕ С
00010 ⊕ С
00001 ⊕ С
00110 ⊕ С
00101 ⊕ С
00011 ⊕ С
00111 = 0 => С
00111 = 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 1 ⊕ 1 ⊕ 0 = 0
F
ж(11110) = С
00000 ⊕ С
10000 ⊕ С
01000 ⊕ С
00100 ⊕ С
00010 ⊕ С
11000 ⊕ С
10100 ⊕ С
10010 ⊕ С
01100 ⊕ С
01010 ⊕ С
00110 ⊕ С
11100 ⊕ С
11010 ⊕ С
10110 ⊕ С
01110 ⊕ С
11110 = 1 => С
11110 = 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 = 0
F
ж(11101) = С
00000 ⊕ С
10000 ⊕ С
01000 ⊕ С
00100 ⊕ С
00001 ⊕ С
11000 ⊕ С
10100 ⊕ С
10001 ⊕ С
01100 ⊕ С
01001 ⊕ С
00101 ⊕ С
11100 ⊕ С
11001 ⊕ С
10101 ⊕ С
01101 ⊕ С
11101 = 1 => С
11101 = 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 = 0
F
ж(11011) = С
00000 ⊕ С
10000 ⊕ С
01000 ⊕ С
00010 ⊕ С
00001 ⊕ С
11000 ⊕ С
10010 ⊕ С
10001 ⊕ С
01010 ⊕ С
01001 ⊕ С
00011 ⊕ С
11010 ⊕ С
11001 ⊕ С
10011 ⊕ С
01011 ⊕ С
11011 = 1 => С
11011 = 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 = 0
F
ж(10111) = С
00000 ⊕ С
10000 ⊕ С
00100 ⊕ С
00010 ⊕ С
00001 ⊕ С
10100 ⊕ С
10010 ⊕ С
10001 ⊕ С
00110 ⊕ С
00101 ⊕ С
00011 ⊕ С
10110 ⊕ С
10101 ⊕ С
10011 ⊕ С
00111 ⊕ С
10111 = 0 => С
10111 = 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 1 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
F
ж(01111) = С
00000 ⊕ С
01000 ⊕ С
00100 ⊕ С
00010 ⊕ С
00001 ⊕ С
01100 ⊕ С
01010 ⊕ С
01001 ⊕ С
00110 ⊕ С
00101 ⊕ С
00011 ⊕ С
01110 ⊕ С
01101 ⊕ С
01011 ⊕ С
00111 ⊕ С
01111 = 0 => С
01111 = 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 1 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
F
ж(11111) = С
00000 ⊕ С
10000 ⊕ С
01000 ⊕ С
00100 ⊕ С
00010 ⊕ С
00001 ⊕ С
11000 ⊕ С
10100 ⊕ С
10010 ⊕ С
10001 ⊕ С
01100 ⊕ С
01010 ⊕ С
01001 ⊕ С
00110 ⊕ С
00101 ⊕ С
00011 ⊕ С
11100 ⊕ С
11010 ⊕ С
11001 ⊕ С
10110 ⊕ С
10101 ⊕ С
10011 ⊕ С
01110 ⊕ С
01101 ⊕ С
01011 ⊕ С
00111 ⊕ С
11110 ⊕ С
11101 ⊕ С
11011 ⊕ С
10111 ⊕ С
01111 ⊕ С
11111 = 1 => С
11111 = 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 ⊕ 1 ⊕ 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 = 0
Таким образом, полином Жегалкина будет равен:
F
ж = 1 ⊕ A∧F ⊕ X∧Y ⊕ X∧Z ⊕ Y∧Z
Логическая схема, соответствующая полиному Жегалкина: