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