                       The Quine-McCluskey Logic Simplifier
                                   Version 0.1
                                 October 8, 2001

Purpose:
The purpose of this program is to simplify boolean logic using the
Quine-McCluskey method.  I am not an expert in digital design and I don't know
all that much about simplifying boolean logic, so the code may contain errors
in the actual implementation of the Quine-McCluskey method.

Compilation:
See "INSTALL" file.

Usage:
Just type 'qmls' in the console.  It takes no arguments or options and does not
prompt you for input.  It reads a canonical decimal list from standard input.
The list must be in this format:
  f(A,X2,Charlie,D22) = m(0,1,3) + d(2)

where:
  A, X1, Charlie, and D22 are the input variables
  0, 1, and 3 are inputs that produce a 1
  2 is a "don't care" input

If there are no "don't care" inputs then the + d(...) may be omitted.
Also, the equation doesn't have to be typed.  It may be kept in a text file and
used as the input to the program with redirection.

For example, if my_file looked like this:
  f(x1,x2,x3,x4,x5) = m(0,2,4,5,8,10,12,13,20,21,28) + d(7,9,11,14,16,27,29)

...you can type:
  qmls <my_file

Buglist:
  * The boolean equation it yields isn't COMPLETELY simplified.
  * It only supports product-of-sums format.
    If maxterms are specified they will be treated as minterms.

If you have find any bugs in or have any comments about my program, please
e-mail me at dalbert@capitol-college.edu.

Dannel Albert, coder.