Best Answer

The simplest way to describe this action is to demonstrate using a simple truth table. This is not intended to be an in depth study of the theorms but a simple demonstration of how a trivial equation can be demorganized. Given a simple boolean equation !A+!B=1. One could show in a truth table. !A !B !A+!B (fully inhibited OR function)

0 0 1

0 1 1

1 0 1

1 1 0 Demorganizing (hypersimplified method)

1) NOT all variables

2) NOT the equation

3) Invert the function (AND to OR or OR to AND)

Iterative steps yeilds

!A becomes !!A which is the same as A

(!!A + !B) = (A+!B)

!B becomes !!B which is the same as B

(A +!!B) = A+B OR function becomes AND

(A+B) = (AB)

NOT the full equation !(AB) = !A+!B Truth table for the new equation (which happens to be a NAND function) A B AB !AB !A+!B

0 0 0 1 1

0 1 0 1 1

1 0 0 1 1

1 1 1 0 0

Q: How do you Demorganize a Boolean expression?

Write your answer...

Submit

Still have questions?

Continue Learning about Math & Arithmetic

Boolean minimization is advantageous because it helps reduce the complexity of logical expressions. By simplifying Boolean expressions, it improves the efficiency of digital circuits, reduces the number of gates required, and minimizes power consumption. Additionally, Boolean minimization makes it easier to understand and analyze the behavior of logical systems.

a+C+BD+B

To simplify a circuit you must first find a Boolean expression for the circuit and then apply Boolean algebra to take it down to the simplest form, to implement the fewest gates.

It is normally regarded as an equation, where y is a function of x. It is possible to regard it as a boolean expression (the equality is true or false).

what is the contribution George Boolean to the development of Boolean operations

Related questions

In a boolean algebraic expression if the ^ is replaced by v and v replaced by ^ then that becomes dual of that boolean expression.

Construct circuit for Boolean expression (Mention out put at each step) (PÚ~ Q) Ù (P Ú Q)

need help to simplify boolean expression

demorganization is used to reduce the Boolean expressions

Boolean expression

That is correct. Any processor worth it's salt will, when evaluating an expression like "1 and 0 and 1 and 1 and 0" will get as far as the first zero and "realize" that full expression will result in false regardless of the rest.

Through Boolean algebra simplification, a Boolean expression is translated to another form with less number of terms and operations. A logic circuit for the simplified Boolean expression performs the identical function with fewer logic components as compared to its original form.

FALSE.... cuz in && operator the compiler chk both of the expression if any of the expression is false then answer will be false.. for true result both of d expression must be true... by warrior2pnk

a ⊕ b = ab' + a'b

A boolean expression.

(a'b+b'a)'

A boolean is an expression obtained in relational operators.