Abstract
A new method for studying mathematical models of discrete logical units based on functional equations is proposed. Representing Boolean functions in the class of formulas (circuits of functional elements with or without branching), we obtain the values of complexity indices in the number of characters, subformulas, and in the depth of a superposition formula (the number of functional elements and the circuit depth). The results are applied in the logical-computational approach to the intellectualization of synthesizing logical units on the basis of digital integrated circuits.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
