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