Таблица истинности для функции ¬A∧V∧¬B∧V∧(C∧V∧A∧B)∧(B∧V∧D):


Промежуточные таблицы истинности:
C∧V:
CVC∧V
000
010
100
111

(C∧V)∧A:
CVAC∧V(C∧V)∧A
00000
00100
01000
01100
10000
10100
11010
11111

((C∧V)∧A)∧B:
CVABC∧V(C∧V)∧A((C∧V)∧A)∧B
0000000
0001000
0010000
0011000
0100000
0101000
0110000
0111000
1000000
1001000
1010000
1011000
1100100
1101100
1110110
1111111

B∧V:
BVB∧V
000
010
100
111

(B∧V)∧D:
BVDB∧V(B∧V)∧D
00000
00100
01000
01100
10000
10100
11010
11111

¬A:
A¬A
01
10

¬B:
B¬B
01
10

(¬A)∧V:
AV¬A(¬A)∧V
0010
0111
1000
1100

((¬A)∧V)∧(¬B):
AVB¬A(¬A)∧V¬B((¬A)∧V)∧(¬B)
0001010
0011000
0101111
0111100
1000010
1010000
1100010
1110000

(((¬A)∧V)∧(¬B))∧V:
AVB¬A(¬A)∧V¬B((¬A)∧V)∧(¬B)(((¬A)∧V)∧(¬B))∧V
00010100
00110000
01011111
01111000
10000100
10100000
11000100
11100000

((((¬A)∧V)∧(¬B))∧V)∧(((C∧V)∧A)∧B):
AVBC¬A(¬A)∧V¬B((¬A)∧V)∧(¬B)(((¬A)∧V)∧(¬B))∧VC∧V(C∧V)∧A((C∧V)∧A)∧B((((¬A)∧V)∧(¬B))∧V)∧(((C∧V)∧A)∧B)
0000101000000
0001101000000
0010100000000
0011100000000
0100111110000
0101111111000
0110110000000
0111110001000
1000001000000
1001001000000
1010000000000
1011000000000
1100001000000
1101001001100
1110000000000
1111000001110

(((((¬A)∧V)∧(¬B))∧V)∧(((C∧V)∧A)∧B))∧((B∧V)∧D):
AVBCD¬A(¬A)∧V¬B((¬A)∧V)∧(¬B)(((¬A)∧V)∧(¬B))∧VC∧V(C∧V)∧A((C∧V)∧A)∧B((((¬A)∧V)∧(¬B))∧V)∧(((C∧V)∧A)∧B)B∧V(B∧V)∧D(((((¬A)∧V)∧(¬B))∧V)∧(((C∧V)∧A)∧B))∧((B∧V)∧D)
00000101000000000
00001101000000000
00010101000000000
00011101000000000
00100100000000000
00101100000000000
00110100000000000
00111100000000000
01000111110000000
01001111110000000
01010111111000000
01011111111000000
01100110000000100
01101110000000110
01110110001000100
01111110001000110
10000001000000000
10001001000000000
10010001000000000
10011001000000000
10100000000000000
10101000000000000
10110000000000000
10111000000000000
11000001000000000
11001001000000000
11010001001100000
11011001001100000
11100000000000100
11101000000000110
11110000001110100
11111000001110110

Общая таблица истинности:

AVBCDC∧V(C∧V)∧A((C∧V)∧A)∧BB∧V(B∧V)∧D¬A¬B(¬A)∧V((¬A)∧V)∧(¬B)(((¬A)∧V)∧(¬B))∧V((((¬A)∧V)∧(¬B))∧V)∧(((C∧V)∧A)∧B)¬A∧V∧¬B∧V∧(C∧V∧A∧B)∧(B∧V∧D)
00000000001100000
00001000001100000
00010000001100000
00011000001100000
00100000001000000
00101000001000000
00110000001000000
00111000001000000
01000000001111100
01001000001111100
01010100001111100
01011100001111100
01100000101010000
01101000111010000
01110100101010000
01111100111010000
10000000000100000
10001000000100000
10010000000100000
10011000000100000
10100000000000000
10101000000000000
10110000000000000
10111000000000000
11000000000100000
11001000000100000
11010110000100000
11011110000100000
11100000100000000
11101000110000000
11110111100000000
11111111110000000

Логическая схема:

Совершенная дизъюнктивная нормальная форма (СДНФ):

По таблице истинности:
AVBCDF
000000
000010
000100
000110
001000
001010
001100
001110
010000
010010
010100
010110
011000
011010
011100
011110
100000
100010
100100
100110
101000
101010
101100
101110
110000
110010
110100
110110
111000
111010
111100
111110
В таблице истинности нет набора значений переменных при которых функция истинна!

Совершенная конъюнктивная нормальная форма (СКНФ):

По таблице истинности:
AVBCDF
000000
000010
000100
000110
001000
001010
001100
001110
010000
010010
010100
010110
011000
011010
011100
011110
100000
100010
100100
100110
101000
101010
101100
101110
110000
110010
110100
110110
111000
111010
111100
111110
Fскнф = (A∨V∨B∨C∨D) ∧ (A∨V∨B∨C∨¬D) ∧ (A∨V∨B∨¬C∨D) ∧ (A∨V∨B∨¬C∨¬D) ∧ (A∨V∨¬B∨C∨D) ∧ (A∨V∨¬B∨C∨¬D) ∧ (A∨V∨¬B∨¬C∨D) ∧ (A∨V∨¬B∨¬C∨¬D) ∧ (A∨¬V∨B∨C∨D) ∧ (A∨¬V∨B∨C∨¬D) ∧ (A∨¬V∨B∨¬C∨D) ∧ (A∨¬V∨B∨¬C∨¬D) ∧ (A∨¬V∨¬B∨C∨D) ∧ (A∨¬V∨¬B∨C∨¬D) ∧ (A∨¬V∨¬B∨¬C∨D) ∧ (A∨¬V∨¬B∨¬C∨¬D) ∧ (¬A∨V∨B∨C∨D) ∧ (¬A∨V∨B∨C∨¬D) ∧ (¬A∨V∨B∨¬C∨D) ∧ (¬A∨V∨B∨¬C∨¬D) ∧ (¬A∨V∨¬B∨C∨D) ∧ (¬A∨V∨¬B∨C∨¬D) ∧ (¬A∨V∨¬B∨¬C∨D) ∧ (¬A∨V∨¬B∨¬C∨¬D) ∧ (¬A∨¬V∨B∨C∨D) ∧ (¬A∨¬V∨B∨C∨¬D) ∧ (¬A∨¬V∨B∨¬C∨D) ∧ (¬A∨¬V∨B∨¬C∨¬D) ∧ (¬A∨¬V∨¬B∨C∨D) ∧ (¬A∨¬V∨¬B∨C∨¬D) ∧ (¬A∨¬V∨¬B∨¬C∨D) ∧ (¬A∨¬V∨¬B∨¬C∨¬D)
Логическая cхема:

Построение полинома Жегалкина:

По таблице истинности функции
AVBCDFж
000000
000010
000100
000110
001000
001010
001100
001110
010000
010010
010100
010110
011000
011010
011100
011110
100000
100010
100100
100110
101000
101010
101100
101110
110000
110010
110100
110110
111000
111010
111100
111110

Построим полином Жегалкина:
Fж = C00000 ⊕ C10000∧A ⊕ C01000∧V ⊕ C00100∧B ⊕ C00010∧C ⊕ C00001∧D ⊕ C11000∧A∧V ⊕ C10100∧A∧B ⊕ C10010∧A∧C ⊕ C10001∧A∧D ⊕ C01100∧V∧B ⊕ C01010∧V∧C ⊕ C01001∧V∧D ⊕ C00110∧B∧C ⊕ C00101∧B∧D ⊕ C00011∧C∧D ⊕ C11100∧A∧V∧B ⊕ C11010∧A∧V∧C ⊕ C11001∧A∧V∧D ⊕ C10110∧A∧B∧C ⊕ C10101∧A∧B∧D ⊕ C10011∧A∧C∧D ⊕ C01110∧V∧B∧C ⊕ C01101∧V∧B∧D ⊕ C01011∧V∧C∧D ⊕ C00111∧B∧C∧D ⊕ C11110∧A∧V∧B∧C ⊕ C11101∧A∧V∧B∧D ⊕ C11011∧A∧V∧C∧D ⊕ C10111∧A∧B∧C∧D ⊕ C01111∧V∧B∧C∧D ⊕ C11111∧A∧V∧B∧C∧D

Так как Fж(00000) = 0, то С00000 = 0.

Далее подставляем все остальные наборы в порядке возрастания числа единиц, подставляя вновь полученные значения в следующие формулы:
Fж(10000) = С00000 ⊕ С10000 = 0 => С10000 = 0 ⊕ 0 = 0
Fж(01000) = С00000 ⊕ С01000 = 0 => С01000 = 0 ⊕ 0 = 0
Fж(00100) = С00000 ⊕ С00100 = 0 => С00100 = 0 ⊕ 0 = 0
Fж(00010) = С00000 ⊕ С00010 = 0 => С00010 = 0 ⊕ 0 = 0
Fж(00001) = С00000 ⊕ С00001 = 0 => С00001 = 0 ⊕ 0 = 0
Fж(11000) = С00000 ⊕ С10000 ⊕ С01000 ⊕ С11000 = 0 => С11000 = 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
Fж(10100) = С00000 ⊕ С10000 ⊕ С00100 ⊕ С10100 = 0 => С10100 = 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
Fж(10010) = С00000 ⊕ С10000 ⊕ С00010 ⊕ С10010 = 0 => С10010 = 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
Fж(10001) = С00000 ⊕ С10000 ⊕ С00001 ⊕ С10001 = 0 => С10001 = 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
Fж(01100) = С00000 ⊕ С01000 ⊕ С00100 ⊕ С01100 = 0 => С01100 = 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
Fж(01010) = С00000 ⊕ С01000 ⊕ С00010 ⊕ С01010 = 0 => С01010 = 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
Fж(01001) = С00000 ⊕ С01000 ⊕ С00001 ⊕ С01001 = 0 => С01001 = 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
Fж(00110) = С00000 ⊕ С00100 ⊕ С00010 ⊕ С00110 = 0 => С00110 = 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
Fж(00101) = С00000 ⊕ С00100 ⊕ С00001 ⊕ С00101 = 0 => С00101 = 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
Fж(00011) = С00000 ⊕ С00010 ⊕ С00001 ⊕ С00011 = 0 => С00011 = 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
Fж(11100) = С00000 ⊕ С10000 ⊕ С01000 ⊕ С00100 ⊕ С11000 ⊕ С10100 ⊕ С01100 ⊕ С11100 = 0 => С11100 = 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
Fж(11010) = С00000 ⊕ С10000 ⊕ С01000 ⊕ С00010 ⊕ С11000 ⊕ С10010 ⊕ С01010 ⊕ С11010 = 0 => С11010 = 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
Fж(11001) = С00000 ⊕ С10000 ⊕ С01000 ⊕ С00001 ⊕ С11000 ⊕ С10001 ⊕ С01001 ⊕ С11001 = 0 => С11001 = 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
Fж(10110) = С00000 ⊕ С10000 ⊕ С00100 ⊕ С00010 ⊕ С10100 ⊕ С10010 ⊕ С00110 ⊕ С10110 = 0 => С10110 = 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
Fж(10101) = С00000 ⊕ С10000 ⊕ С00100 ⊕ С00001 ⊕ С10100 ⊕ С10001 ⊕ С00101 ⊕ С10101 = 0 => С10101 = 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
Fж(10011) = С00000 ⊕ С10000 ⊕ С00010 ⊕ С00001 ⊕ С10010 ⊕ С10001 ⊕ С00011 ⊕ С10011 = 0 => С10011 = 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
Fж(01110) = С00000 ⊕ С01000 ⊕ С00100 ⊕ С00010 ⊕ С01100 ⊕ С01010 ⊕ С00110 ⊕ С01110 = 0 => С01110 = 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
Fж(01101) = С00000 ⊕ С01000 ⊕ С00100 ⊕ С00001 ⊕ С01100 ⊕ С01001 ⊕ С00101 ⊕ С01101 = 0 => С01101 = 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
Fж(01011) = С00000 ⊕ С01000 ⊕ С00010 ⊕ С00001 ⊕ С01010 ⊕ С01001 ⊕ С00011 ⊕ С01011 = 0 => С01011 = 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
Fж(00111) = С00000 ⊕ С00100 ⊕ С00010 ⊕ С00001 ⊕ С00110 ⊕ С00101 ⊕ С00011 ⊕ С00111 = 0 => С00111 = 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 = 0
Fж(11110) = С00000 ⊕ С10000 ⊕ С01000 ⊕ С00100 ⊕ С00010 ⊕ С11000 ⊕ С10100 ⊕ С10010 ⊕ С01100 ⊕ С01010 ⊕ С00110 ⊕ С11100 ⊕ С11010 ⊕ С10110 ⊕ С01110 ⊕ С11110 = 0 => С11110 = 0 ⊕ 0 ⊕ 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 = 0 ⊕ 0 ⊕ 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 = 0 ⊕ 0 ⊕ 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 = 0 ⊕ 0 ⊕ 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 = 0 => С01111 = 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 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 = 0 => С11111 = 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 ⊕ 0 = 0

Таким образом, полином Жегалкина будет равен:
Fж = 0

Околостуденческое

Рейтинг@Mail.ru

© 2009-2024, Список Литературы