- #1

- 92

- 0

## Main Question or Discussion Point

I know this is probably in the wrong board, but.

I'v just been looking into some Boolean algebra to convert truth tables into a set of logic gates representing a circuit.

If i were attempting to represent a certain truth table, but i was limited to ONLY using NAND gates. (their the only one's i can find). How would i go about doing this.

IM assuming i get a boolean expression for the truth table, and then attempt to factorize it into a certain form which uses only NAND gates. BUt im not exactly sure how to proceed.

I'v just been looking into some Boolean algebra to convert truth tables into a set of logic gates representing a circuit.

If i were attempting to represent a certain truth table, but i was limited to ONLY using NAND gates. (their the only one's i can find). How would i go about doing this.

IM assuming i get a boolean expression for the truth table, and then attempt to factorize it into a certain form which uses only NAND gates. BUt im not exactly sure how to proceed.