I'm trying to simplify the expression given by the following Karnaugh map to an expression that is using only NANDs, NOTs and ANDs- the less gates (of any kind), the better.
I know how to optimize it to an (OR,AND,NOT) system, but that doesn't seem to help.
I also know how to create an OR gate using only NANDs and NOTs, but that creates a really complicated expression and I've been hinted there's a simple one.
I tried using Wolfram Alpha, but no (AND,NAND,NOT) system exist. The closest one is a (NAND, NOT) system and that expression still looks complicated.
I'm allowed 4 inputs per NAND and 2 inputs per AND.
Thanks in advance!