Joykrishan:

See: http://sce.umkc.edu/~hieberm/281_new/lectures/simplification/simplification.html

There are two serious limitations to using Boolean algebra

There is no algorithm you can follow that is guaranteed to lead to the simplest form of the expression

Given any intermediate result there is no way to tell if it is in fact the simplest form of the expression

That doesn't mean that you can't simplify expressions, only that you can't be

sure that you have always found the minimal expression. This is a subproblem of

term rewriting.

Also, see: http://www.wolfram.com/products/mathematica/newin7/content/IndustrialStrengthBooleanComputation/

for more information on minimization of formulas with up to thousands of variables.

F=w'x(z'+yz)+y(ww+w'yz)

=w'xz'+w'yz+yww+yw'yz

=w'xz'+w'yz+yw+w'yyz

=w'xz'+w'yz+yw+w'yz

=w'xz'+w'yz+w'yz+yw

=w'xz'+(w'yz+w'yz)+yw

=w'xz'+w'yz+yw

=w'(xz'+yz)+yw