Список литературы
Генератор кроссвордов
Генератор титульных листов
Таблица истинности ONLINE
Прочие ONLINE сервисы
|
Таблица истинности для функции ¬(¬(X∧Y∧Z)∧¬(X∧¬Y∧¬Z)∧(¬(X∧Y∧V))∧(¬(¬X∧¬Y∧Z∧V))):
Общая таблица истинности:X | Y | Z | V | X∧Y | (X∧Y)∧Z | ¬Y | ¬Z | X∧(¬Y) | (X∧(¬Y))∧(¬Z) | (X∧Y)∧V | ¬((X∧Y)∧V) | ¬X | (¬X)∧(¬Y) | ((¬X)∧(¬Y))∧Z | (((¬X)∧(¬Y))∧Z)∧V | ¬((((¬X)∧(¬Y))∧Z)∧V) | ¬((X∧Y)∧Z) | ¬((X∧(¬Y))∧(¬Z)) | (¬((X∧Y)∧Z))∧(¬((X∧(¬Y))∧(¬Z))) | ((¬((X∧Y)∧Z))∧(¬((X∧(¬Y))∧(¬Z))))∧(¬((X∧Y)∧V)) | (((¬((X∧Y)∧Z))∧(¬((X∧(¬Y))∧(¬Z))))∧(¬((X∧Y)∧V)))∧(¬((((¬X)∧(¬Y))∧Z)∧V)) | ¬(¬(X∧Y∧Z)∧¬(X∧¬Y∧¬Z)∧(¬(X∧Y∧V))∧(¬(¬X∧¬Y∧Z∧V))) | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 |
Логическая схема:
Совершенная дизъюнктивная нормальная форма (СДНФ):
По таблице истинности: X | Y | Z | V | F | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 |
F сднф = ¬X∧¬Y∧Z∧V ∨ X∧¬Y∧¬Z∧¬V ∨ X∧¬Y∧¬Z∧V ∨ X∧Y∧¬Z∧V ∨ X∧Y∧Z∧¬V ∨ X∧Y∧Z∧V Логическая cхема:
Совершенная конъюнктивная нормальная форма (СКНФ):
По таблице истинности: X | Y | Z | V | F | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 |
F скнф = (X∨Y∨Z∨V) ∧ (X∨Y∨Z∨¬V) ∧ (X∨Y∨¬Z∨V) ∧ (X∨¬Y∨Z∨V) ∧ (X∨¬Y∨Z∨¬V) ∧ (X∨¬Y∨¬Z∨V) ∧ (X∨¬Y∨¬Z∨¬V) ∧ (¬X∨Y∨¬Z∨V) ∧ (¬X∨Y∨¬Z∨¬V) ∧ (¬X∨¬Y∨Z∨V) Логическая cхема:
|
![](/img/grey.gif) |
![](/img/grey.gif) |
![](/img/spacer.gif) |
|
Вход на сайт
Информация
В нашем каталоге
Околостуденческое
|