ABOUT SYNTHESIS OF SOME CLASSES OF CONTROLLING SYSTEMS CONNECTED WITH IMPLICIT AND PARAMETRIC REPRESENTATION OF BOOLEAN FUNCTIONS

The Shannon function asymptotics for complexity of the parametric representation above any parametric-complete finite Boolean basis with positive weights has been obtained. The Shannon function asymptotics for complexity of the networks of functional elements above any complete (in the corresponding sense) finite Boolean basis with positive weights has been found. The evaluations of the complexity for networks above some infinite basises have been obtained. The Shannon function asymptotics for complexity of realizing Boolean functions in the mathematical models of the electron CMOS-circuits has been obtained. The equivalence of the implicit and parametric expressability in the binary logics has been proven. The transitivity problem of the implicit expressionability relation in the binary logics has been solved; the complete classification of the two-element algebras with accuracy up to the cryptoisomorphism has been given.Available from VNTIC / VNTIC - Scientific & Technical Information Centre of RussiaSIGLERURussian Federatio