On logic algebra formulas' complexity in some complete bases consisting of elements with both direct and iterative inputs

Background. One of the main problems in mathematical cybernetics is the problem of control systems synthesis, consisting in building of a circuit from a given class that will realize a given Boolean function. At solving of the problem one often needs to take into account various limitations of control systems' structure and parameters. Such limitations often describe real calculations more precisely and have a physical interpretation. Moreover, the studies of the complexity of realization of Boolean functions in models with limitations and the effects of limitation parameters are of great theoretical interest. In the present work the limitation is associated with methods of gates connection in a circuit. Circuit elements' inputs are divided into 2 types - direct and iterative. Iterative inputs are used for connection of other elements' outputs to them, and direct inputs serve as circuits' inputs. The synthesis problem in this model is considered for a case of formulas, i.e. circuits without elements' inputs branching. The aim of the work is to obtain asymptotics of the Shannon function for the complexity of the formulas in the class of complete bases, whose iterative closure contains the class of monotonic functions. In such bases, as it has been previously obtained, the order of growth of this function is “standard” for Boolean formulas, however, the constant in the asymptotics hasn't been revealed. Matherials and methods. In this work in particular the authors show the modification of the previously known optimal method of formulas synthesis using the technique of logic-algebra functions modeling by variables on components of special partitions of multiple sets of the Boolean cube. Results. The authors revealed an asymptotic behavior of the Shannon function for the complexity of Boolean formulas in complete bases with direct and iterative variables, whose iterative closure contains the class of all monotonic functions. The method of finding the constant in the asymptotics was also specified. Conclusions. The established results allow to conclude about the existence of the asymptotic behavior of the Shannon function for formulas in separate classes of bases with direct and iterative variables, where the order of this function is “standard”, and coincides with the order of growth of the corresponding functions for a class of Boolean formulas in regular full bases.