Here is my solution:I am having trouble reducing the following probems.
F = AB’CD’ + A’BCD’+AB’C’D+A’BC’D
F = A’BC’+ A’B’C+ AC’D+ ACD’
F = (A′ + BD′ + AD) (B + C′) (A+ B′C)
Any help would be appreciated.
Thanks in advance.
|Thread starter||Similar threads||Forum||Replies||Date|
|Solving boolean expression using annihilation rule||Homework Help||1|
|I||Deriving Product of Sum from circuit (decoder + AND gate)||Homework Help||2|
|M||how to simplify this boolean algebra expression with only boolean algebra||Homework Help||4|
|P||From boolean algebra to logic gates||Homework Help||8|
|H||Boolean Algebra simplification||Homework Help||1|
by Gary Elinoff
by Luke James
by Nidia Trejo