The minimal volume of memory necessary for realizing the functions of Boolean algebra by converter circuits

MaRDI QIDQ1848652zbMATH OpenFDO

Authors Yanyan Li

Publication date 13 November 2002

Published in Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

Boolean conveyor schemesBoolean function

Mathematics Subject Classification ID

Synthesis problems (93B50)

Review text

The article considers iterative control systems with memory. The notion of conveyor Boolean circuit is introduced. A variety of subclasses of the conveyor circuits class is considered, and in some of the subclasses the minimal memory volume for the realization of an arbitrary Boolean function is obtained.

Recommendations

• On the minimal memory volume that is necessary for realization of boolean function by conveyor boolean circuits
• The complexity of Boolean function implementation in some classes of automaton circuits
• On minimal realizations of linear Boolean functions
• The minimal circuits for linear Boolean functions
• scientific article; zbMATH DE number 4176981

Cited in

(1)

• On the minimal memory volume that is necessary for realization of boolean function by conveyor boolean circuits

This page was built for publication: The minimal volume of memory necessary for realizing the functions of Boolean algebra by converter circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1848652)