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