Here's the question you clicked on:
anima
Rewrite the expression xy+z' in terms of bar and the NAND operation
this is the NAND operation for the que above...please someone help
not sure what "bar" represents is this boolean algebra ?
Can you rewrite it again.
One way could be, to draw it out, convert into NAND equivalents and form the equations.
im stuck of course you could be fancy and negate the NAND resulting in original AND operation --> xy +z' = [(xy)']' +z'
I got xy(bar).z(whole bar), sorry i dont know how to put that in latex.
arctic is that NAND(x,y) and z' ? it wont work for all values of 1 x=y=z=1 yields xy+z' = 1 (xy)'z' = 0
noh |dw:1334738031932:dw|
ahh i see, yes that would work :) good job
@anima Do you know what are NAND equivalents for NOT, AND and OR gates?
If you dont, check this http://en.wikipedia.org/wiki/NAND_logic Then substitute all the NAND forms given to you, then form the expression again. You will yield this.
Another simpler way would be using, Boolean algebra and De Morgan's laws.