RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika // Archive

Prikl. Diskr. Mat., 2010 Number 4(10), Pages 55–63 (Mi pdm256)

This article is cited in 1 paper

Logical Design of Discrete Automata

Series parallel decomposition of a system of incompletely specified Boolean functions

Yu. V. Pottosin, E. A. Shestakov

United Institute of Informatics Problems of the National Academy of Sciences of Belarus, Minsk, Belarus

Abstract: The decomposition problem for a system of incompletely specified Boolean functions is considered. The concept of function dependence on some arguments is introduced for appreciating the complexity of decomposition components. A method for series parallel decomposition of a system of incompletely specified Boolean functions is suggested. The peculiarity of the method is that the arguments of components are not given and are found in the process of decomposition.

Keywords: system of incompletely specified Boolean functions, decomposition.

UDC: 519.714+681.32



© Steklov Math. Inst. of RAS, 2024