How Do You Simplify Complex Boolean Expressions?

AI Thread Summary
The discussion focuses on simplifying the Boolean expression Y(NX'Z + NX' + NZ'). The user attempts to apply simplification rules but is uncertain about their progress. They arrive at Y(NX') after applying the rules A + A = A, A + A' = 1, and A x A = 1. Another participant suggests verifying the simplification by drawing a truth table for the Z and X components. The conversation emphasizes the importance of confirming the final expression through additional methods.
TheTopGun
Messages
16
Reaction score
0

Homework Statement


Ok so I'm having trouble simplifying a part of a boolean equation. It needs to be in the form Yt(...)


Homework Equations


note X' means Not X

The part to be simplified is.. Y(NX'Z+NX'+NZ')

The Attempt at a Solution


Using the rules of simplification, particularly A+A=A, A+A'=1, AxA=1
Ive come down to this but I am still unsure if I am on the right track..

Y(NX'Z+NX'+NZ') ... so N + N + N = N, X' + X' = X', Z + Z' = 1
Y(NX'(1))
Y(NX')

Could someone confirm this, or tell me I am completely wrong :rolleyes:

Thankyou!
 
Physics news on Phys.org
TheTopGun said:
Using the rules of simplification, particularly A+A=A, A+A'=1, AxA=1[/color] :confused:



Y(NX'Z+NX'+NZ') ... so N + N + N = N, X' + X' = X', Z + Z' = 1
Y(NX'(1))
Y(NX')
Skip the common term N, you could draw up a truth table for the Z and X parts and see whether your answer checks out.

What does X' Z + X' simplify to?
 

Similar threads

Back
Top