MINIMIZATION LOGICAL FUNCTION BY METHOD TO ALTERNATIVE ADAPTATION

Abstract

Approach is offered In article to minimization boolean function, founded on use automaton to adaptation. As bases is used known method to minimization boolean function, founded on partition implicant units made disjunctive normal form boolean function on two ensembles and join nearby implicant. The Proposed automaton to adaptation, in the event of hit in local optimum allows to realize return to previous decision. Given characteristic allows effectively to come out of local optimum.

Keywords

• минимизация булевых функций
• автоматы адаптации
• сапр сбис