Simplify boolean expression algorithm

Question

Anybody knows of an algorithm to simplify boolean expressions?

I remember the boolean algebra and Karnaught maps, but this is meant for digital hardware where EVERIT

Answer 1

This is hard man. The algorithm in the simplest way that I found was match every output combination with each input each combination. But that's the basic algorithm, didn't solve every expression.

If all output (q1,q2,q3,q4) is same with for i.e input A combination then the result of simplification will be A.

If not, you will try another variabel / input dependency.