| Author |
Message |
hamid14
|
 Posted: Tue Dec 13, 2011 7:55 pm Post subject: simplifying boolean equation tej4mi |
|
|
ive been trying to simplify this boolean equation for over an hour now, and im completely out of ideas on how to simplify it. If anyone can help me get started I would be most grateful.
Y = (NOT A . NOT B . NOT C) + (NOT A . NOT B. C) + (NOT A. B. C) + (A. NOT B. C) + (A. B. C)
This is from the course tej4mi if anyone is wondering. thanks in advance  |
|
|
|
|
 |
Sponsor
Sponsor
|
|
|
Brightguy
|
| Posted: Tue Dec 13, 2011 8:16 pm Post subject: Re: simplifying boolean equation tej4mi |
|
|
| Well, the formula is already in disjunctive normal form, from which you can look for simplifications by combining clauses. For example, replace the first two clauses with (~A&~B). |
|
|
|
|
|
DemonWasp
|
| Posted: Tue Dec 13, 2011 8:24 pm Post subject: RE:simplifying boolean equation tej4mi |
|
|
| Try factoring the "and C" out of the last 4 bracketed groups (not the first one). |
|
|
|
|
|
|
Register
Wiki
Blog
Search
Turing
Chat Room
Members
