Topological equivalence classification and enumeration of n-input linearly separable Boolean functions

DOI10.1016/J.INS.2023.120020MaRDI QIDQ6153220zbMATH OpenOpenAlexFDO

Authors

Publication date 13 February 2024

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2023.120020

zbMATH Keywords

balanced linearly separable Boolean function (BLSBF)conformal transformationinseparable factorminimal subsystem (MS)topological equivalence

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Recommendations

• Topological Equivalence Classification of Balanced Linearly Separable Boolean Functions on n-Dimensional Hypercube
• IDENTIFICATION AND REALIZATION OF LINEARLY SEPARABLE BOOLEAN FUNCTIONS VIA CELLULAR NEURAL NETWORKS
• Separable Boolean functions and generalized Fibonacci sequences
• Learning with permutably homogeneous multiple-valued multiple-threshold perceptrons
• LEARNING CLASSES OF LINEARLY SEPARABLE BOOLEAN FUNCTIONS FROM POSITIVE EXAMPLES

Cites work

• A logical calculus of the ideas immanent in nervous activity
• A novel method for speed training acceleration of recurrent neural networks
• Breaker Page
• Diagnosing double regular systems
• Directed projection graph of \(N\)-dimensional hypercube and subhypercube decomposition of balanced linearly separable Boolean functions
• Enumeration of Threshold Functions of Eight Variables
• scientific article; zbMATH DE number 795573 (Why is no real title available?)
• scientific article; zbMATH DE number 3266648 (Why is no real title available?)
• scientific article; zbMATH DE number 3385535 (Why is no real title available?)
• Majority Decision Functions of up to Six Variables
• Partitioning points by parallel planes
• REALIZATION AND BIFURCATION OF BOOLEAN FUNCTIONS VIA CELLULAR NEURAL NETWORKS
• REALIZATION OF BOOLEAN FUNCTIONS VIA CNN WITH VON NEUMANN NEIGHBORHOODS
• Realization of Boolean Functions via CNN: Mathematical Theory, LSBF and Template Design
• Topological Equivalence Classification of Balanced Linearly Separable Boolean Functions on n-Dimensional Hypercube
• Universal Perceptron Theory on Decomposition Structures of n-Bit Boolean Functions

This page was built for publication: Topological equivalence classification and enumeration of \(n\)-input linearly separable Boolean functions

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