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