Some remarks on the canonical forms for pseudo-Boolean functions.
Sur la minimisation d'une expression représentant une famille de fonctions booléennes
Synthesis of finite state machines for CPLDs
The paper presents a new two-step approach to FSM synthesis for PAL-based CPLDs that strives to find an optimum fit of an FSM to the structure of the CPLD. The first step, the original state assignment method, includes techniques of twolevel minimization and aims at area minimization. The second step, PAL-oriented multi-level optimization, is a search for implicants that can be shared by several functions. It is based on the graph of outputs. Results of experiments prove that the presented approach...
Synthesis of probability transformers
The computation of characteristic vectors of logical-probabilistic expressions
The conjunction of a particular form of majority logic functions and some of its properties
The logic of neural networks.
This paper establishes the equivalence between multilayer feedforward networks and linear combinations of Lukasiewicz propositions. In this sense, multilayer forward networks have a logic interpretation, which should permit to apply logical techniques in the neural networks framework.
The Number of Non-Isomorphic Hamiltonian Circuits in an -Dimensional Cube
The semigroup of circulant Boolean matrices
The spectral test of the Boolean function linearity
The paper discusses the problem of recognizing the Boolean function linearity. A spectral method of the analysis of Boolean functions using the Walsh transform is described. Linearity and nonlinearity play important roles in the design of digital circuits. The analysis of the distribution of spectral coefficients allows us to determine various combinatorial properties of Boolean functions, such as redundancy, monotonicity, self-duality, correcting capability, etc., which seems more difficult be...
Towards a characterization of bipartite switching classes by means of forbidden subgraphs
We investigate which switching classes do not contain a bipartite graph. Our final aim is a characterization by means of a set of critically non-bipartite graphs: they do not have a bipartite switch, but every induced proper subgraph does. In addition to the odd cycles, we list a number of exceptional cases and prove that these are indeed critically non-bipartite. Finally, we give a number of structural results towards proving the fact that we have indeed found them all. The search for critically...
Type et graphe des distances d'une fonction booléenne
Un algorithme efficace pour un arbre de classifications
Une heuristique pour le problème de l'arbre de Steiner
Univerzální logické funkce a syntéza booleovských funkcí pomocí univerzálních modulů
WWW-based Boolean function minimization
In this paper a Boolean minimization algorithm is considered and implemented as an applet in Java. The application is based on the Quine-McCluskey simplification technique with some modifications. The given application can be accessed on line since it is posted on the World Wide Web (WWW), with up to four variables, at the URL http://www.csam.montclair.edu/~antoniou/bs. After extensive testing, the performance of the algorithm has been found to be excellent. The proposed application is a useful...
Алгоритм синтеза минимальных -схем без нулавых цепей, реализующих характеристические функции линейных кодов
Алгорифм составления оптимального расписания для параллельно последовательной сети
Влияние нулевых цепей на сложность контактных схем
Вычисление булевых функций на машинах Тьюринга