This article is cited in 1 paper

Computational Methods in Discrete Mathematics

Algorithms for constructing the shortest allowable partitions of finite sets

L. N. Andreeva

Tomsk State University, Tomsk, Russia

Abstract: Algorithms for constructing the shortest allowable partitions of finite sets both for any monotonic and nonmonotonic two components allowing functions are presented in the paper. The synthesis problem for minimal complexity PLD-circuits and the composition problem of an electronic circuit into the minimal number of cells are good examples for the application of these algorithms.

UDC: 519.7