Список литературы
Генератор кроссвордов
Генератор титульных листов
Таблица истинности ONLINE
Прочие ONLINE сервисы
|
Таблица истинности для функции D∧A→(A∧D⊕¬(D∨A∧C))∧A∨¬(D∧C→A∧C):
Промежуточные таблицы истинности:A∧C: D∨(A∧C): D | A | C | A∧C | D∨(A∧C) | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 |
¬(D∨(A∧C)): D | A | C | A∧C | D∨(A∧C) | ¬(D∨(A∧C)) | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 |
A∧D: (A∧D)⊕(¬(D∨(A∧C))): A | D | C | A∧D | A∧C | D∨(A∧C) | ¬(D∨(A∧C)) | (A∧D)⊕(¬(D∨(A∧C))) | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 1 |
D∧C: (D∧C)→(A∧C): D | C | A | D∧C | A∧C | (D∧C)→(A∧C) | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 |
¬((D∧C)→(A∧C)): D | C | A | D∧C | A∧C | (D∧C)→(A∧C) | ¬((D∧C)→(A∧C)) | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 |
D∧A: ((A∧D)⊕(¬(D∨(A∧C))))∧A: A | D | C | A∧D | A∧C | D∨(A∧C) | ¬(D∨(A∧C)) | (A∧D)⊕(¬(D∨(A∧C))) | ((A∧D)⊕(¬(D∨(A∧C))))∧A | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 |
(((A∧D)⊕(¬(D∨(A∧C))))∧A)∨(¬((D∧C)→(A∧C))): A | D | C | A∧D | A∧C | D∨(A∧C) | ¬(D∨(A∧C)) | (A∧D)⊕(¬(D∨(A∧C))) | ((A∧D)⊕(¬(D∨(A∧C))))∧A | D∧C | A∧C | (D∧C)→(A∧C) | ¬((D∧C)→(A∧C)) | (((A∧D)⊕(¬(D∨(A∧C))))∧A)∨(¬((D∧C)→(A∧C))) | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 |
(D∧A)→((((A∧D)⊕(¬(D∨(A∧C))))∧A)∨(¬((D∧C)→(A∧C)))): D | A | C | D∧A | A∧D | A∧C | D∨(A∧C) | ¬(D∨(A∧C)) | (A∧D)⊕(¬(D∨(A∧C))) | ((A∧D)⊕(¬(D∨(A∧C))))∧A | D∧C | A∧C | (D∧C)→(A∧C) | ¬((D∧C)→(A∧C)) | (((A∧D)⊕(¬(D∨(A∧C))))∧A)∨(¬((D∧C)→(A∧C))) | (D∧A)→((((A∧D)⊕(¬(D∨(A∧C))))∧A)∨(¬((D∧C)→(A∧C)))) | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 |
Общая таблица истинности:D | A | C | A∧C | D∨(A∧C) | ¬(D∨(A∧C)) | A∧D | (A∧D)⊕(¬(D∨(A∧C))) | D∧C | (D∧C)→(A∧C) | ¬((D∧C)→(A∧C)) | D∧A | ((A∧D)⊕(¬(D∨(A∧C))))∧A | (((A∧D)⊕(¬(D∨(A∧C))))∧A)∨(¬((D∧C)→(A∧C))) | D∧A→(A∧D⊕¬(D∨A∧C))∧A∨¬(D∧C→A∧C) | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 |
Логическая схема:
Совершенная дизъюнктивная нормальная форма (СДНФ):
По таблице истинности: D | A | C | F | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
F сднф = ¬D∧¬A∧¬C ∨ ¬D∧¬A∧C ∨ ¬D∧A∧¬C ∨ ¬D∧A∧C ∨ D∧¬A∧¬C ∨ D∧¬A∧C ∨ D∧A∧¬C ∨ D∧A∧C Логическая cхема:
Совершенная конъюнктивная нормальная форма (СКНФ):
По таблице истинности: D | A | C | F | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
В таблице истинности нет набора значений переменных при которых функция ложна!
Построение полинома Жегалкина:
По таблице истинности функции D | A | C | Fж | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
Построим полином Жегалкина: F ж = C 000 ⊕ C 100∧D ⊕ C 010∧A ⊕ C 001∧C ⊕ C 110∧D∧A ⊕ C 101∧D∧C ⊕ C 011∧A∧C ⊕ C 111∧D∧A∧C Так как F ж(000) = 1, то С 000 = 1. Далее подставляем все остальные наборы в порядке возрастания числа единиц, подставляя вновь полученные значения в следующие формулы: F ж(100) = С 000 ⊕ С 100 = 1 => С 100 = 1 ⊕ 1 = 0 F ж(010) = С 000 ⊕ С 010 = 1 => С 010 = 1 ⊕ 1 = 0 F ж(001) = С 000 ⊕ С 001 = 1 => С 001 = 1 ⊕ 1 = 0 F ж(110) = С 000 ⊕ С 100 ⊕ С 010 ⊕ С 110 = 1 => С 110 = 1 ⊕ 0 ⊕ 0 ⊕ 1 = 0 F ж(101) = С 000 ⊕ С 100 ⊕ С 001 ⊕ С 101 = 1 => С 101 = 1 ⊕ 0 ⊕ 0 ⊕ 1 = 0 F ж(011) = С 000 ⊕ С 010 ⊕ С 001 ⊕ С 011 = 1 => С 011 = 1 ⊕ 0 ⊕ 0 ⊕ 1 = 0 F ж(111) = С 000 ⊕ С 100 ⊕ С 010 ⊕ С 001 ⊕ С 110 ⊕ С 101 ⊕ С 011 ⊕ С 111 = 1 => С 111 = 1 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 0 ⊕ 1 = 0 Таким образом, полином Жегалкина будет равен: F ж = 1
|
|
|
|
|
Вход на сайт
Информация
В нашем каталоге
Околостуденческое
|