minDNF                package:logicFS                R Documentation

_M_i_n_i_m_u_m _D_i_s_j_u_n_c_t_i_v_e _N_o_r_m_a_l _F_o_r_m

_D_e_s_c_r_i_p_t_i_o_n:

     Computes the prime implicants or the minimal disjuntive form,
     respectively, of a given truth table.

_U_s_a_g_e:

       prime.implicants(mat)
       minDNF(mat)

_A_r_g_u_m_e_n_t_s:

     mat: a matrix containing only 0's and 1's. Each column of 'mat'
          corresponds to a binary variable and each row to a
          combination of the variables for which the logic expression
          is TRUE.

_D_e_t_a_i_l_s:

     'minDNF' is a fast implementation of the Quine-McCluskey algorithm
     using matrix algebra. A Tech. Report on this implementation will
     follow soon.

_V_a_l_u_e:

     Either an object of class 'minDNF' or of class 'primeImp'. Both
     contain a vector of (a minimum number of) prime implicants. The
     'primeImp' additionally contains the prime implicant table.

_A_u_t_h_o_r(_s):

     Holger Schwender, holger.schwender@udo.edu

_S_e_e _A_l_s_o:

     'logic.pimp'

