319 views
3 votes
3 votes

1 Answer

Best answer
1 votes
1 votes

Disjunctive normal form is sum of product terms

For example, all of the following formulae are in DNF:

  • (A\land \neg B\land \neg C)\lor (\neg D\land E\land F)
  • (A\land B)\lor C
  • A\land B
  • A

However, the following formulae are not in DNF:

  • \neg (A\lor B), since an OR is nested within a NOT
  • A\lor (B\land (C\lor D)), since an OR is nested within an AND
selected by

Related questions

0 votes
0 votes
0 answers
1
shefali1 asked Sep 29, 2017
180 views
0 votes
0 votes
1 answer
2
Rajib Datta Roy asked Nov 2, 2023
198 views
((f,g)|f(0)=g(0) or f(1)=g(1)) is the relation equivalent on set of function for all Z to Z . I find this to be equivalence relation ,but the solution says its not .ca...
0 votes
0 votes
0 answers
3
amit166 asked Jan 19, 2023
238 views
1 votes
1 votes
1 answer
4
amit166 asked Jan 5, 2023
285 views
Time complexity=$\sum_{i=1}^{n}[\log (\frac{n}{i})] is$