boolean-algebra

问题 Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers. Want to improve this question? Update the question so it's on-topic for Stack Overflow. Closed 2 months ago . Improve this question I have a boolean function that is presented by truth table. In total it is 10 variables and I'd like to get CNF with a reasonable length (not necessary the shortest, but short enough). How can I do it? Python script or any public available software such as

问题 Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers. Want to improve this question? Update the question so it's on-topic for Stack Overflow. Closed 2 months ago . Improve this question I have a boolean function that is presented by truth table. In total it is 10 variables and I'd like to get CNF with a reasonable length (not necessary the shortest, but short enough). How can I do it? Python script or any public available software such as

问题 I have a 2-1 mux and I'm trying to write z = s'd0 + sd1 using only NAND , XNOR , and OR gates (not necessarily all of them). I tried simplifying it and what I ended up with is z = NAND(NAND(s', d0), NAND(s, d1)) , but I can't use NOT ( ' ), so is there a way to write NAND(s', d0) without the NOT ? 回答1: You can build NOT from NAND: NAND(X,X) == NOT(X) 回答2: NAND gate is an universal gate; you can use it to make any other gate. s' = nand(s,s) 回答3: Initial solution Full version of the solution