@Article{Petrik:QuineMcCluskeyMethodForManyValuedLogicalFunctions,
  IS = { zkontrolovano 15 Dec 2007 },
  UPDATE  = { 2007-12-11 },
  author =     { Petr{\'\i}k, Milan },
  title =      { {Q}uine-{M}c{C}luskey method for many-valued logical functions },
  year =       { 2007 },
  month =      { April },
  pages =      { 393--402 },
  journal =    { Soft Computing - A Fusion of Foundations, Methodologies and Applications },
  publisher =  { Springer },
  address =    { Berlin, Germany },
  issn =       { 1432-7643 },
  volume =     { 12 },
  number =     { 4 },
  authorship = { 100 },
  annote = { In this paper we deal with a generalization of the
    Quine McCluskey method. We show that the generalized method
    can find a normal form for any finite-valued logical
    function. Moreover, this normal form is simpler than that found by
    the intuitive method using the table of values. The method has
    been successfully implemented and tested on examples. },
  keywords =   { many-valued logic, hardware design, logical circuit design, normal form },
  project =    { GACR 201/07/1136 },
}