PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Morreale E. Recursive partitioned list algorithms for prime implicants and irredundant form determination. Internal note IEI-B68-20, 1968.
 
 
Abstract
(English)
A common recursive formulation is presented for determining l) all the prime implicants, and 2) an irredundant normal form of any completely or incompletely specified, uni - or multi terminal Boolean function given in canonical form. Formulas for the specific operators Pi and Irr2 solving these problems are given find recursive partitioned list algorithms are described for them. The solution of both the above problems through recursive partitioned list algorithms restults significantly faster than through the corresponding nonrecursive algorithms.
Subject Recursive partitioned


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional