The object of solving the problem of minimizing the Boolean function in this work is a block
diagram with repetition, what is the truth table of the given function. This allows to leave the …

We propose a new three-level XOR-AND-XOR form for autosymmetric functions, called
XORAX expression. In general, a Boolean function over variables is-autosymmetric if it can …

XOR-AND Graphs (XAGs) are an enrichment of the classical AND-Inverter Graphs (AIGs)
with XOR nodes. In particular, XAGs are networks composed by ANDs, XORs, and inverters …

Multi-terminal switching lattices are typically exploited for modeling switching nano-crossbar
arrays that lead to the design and construction of emerging nanocomputers. Typically, the …

The object of research is a combinatorial method of 5-bit Boolean functions minimization.
One of the most problematic places for Boolean functions minimization is the complexity of …

The utilization of EXOR gates often decreases the number of gates needed for realizing
practical logical networks, and enhances the testability of networks. Therefore, logic …

We define and study a new class of regular Boolean functions called D-reducible. A D-
reducible function, depending on all its n input variables, can be studied and synthesized in …

Autosymmetric functions exhibit a special type of regularity that can speed-up the
minimization process. Based on this autosymmetry, we propose a three level form of logic …

Multi-terminal switching lattices are typically exploited for modeling switching nano-crossbar
arrays that lead to the design and construction of emerging nanocomputers. In this paper we …

The" regularity" of a Boolean function can be exploited for decreasing its minimization time. It
has already been shown that the notion of autosymmetry is a valid measure of regularity …