Based on the previous work of a number of authors, we discuss an important class of neural networks which we call multi-associative neural networks (MANNs) and which associate one pattern with multiple patterns. As a computationally efficient example of such networks, we describe a specific MANN, that is, a multi-associative, dynamically generated variant of the counterpropagation network (MCPN...

In this paper we present a new approach for the realization of a BDD-package. This approach does not depend on recursive synthesis operations (i.e. the ternary If-Then-Else-operator (ITE)) to perform manipulations of Boolean functions; instead our basic operation MORE is based on exchanges of neighbouring variables and existential quantiication. It is capable of combining an arbitrary number of...

In this paper we present a new approach for the realization of a BDD-package. This approach does not depend on recursive synthesis operations (i.e. the ternary If-Then-Else-operator (ITE)) to perform manipulations of Boolean functions; instead our basic operation MORE is based on exchanges of neighbouring variables and existential quantiication. It is capable of combining an arbitrary number of...

This paper examines ternary algebras, their practical applications and how to translate between the natural dual and the restricted Priestley dual of these algebras. We begin by determining the term functions of the standard ternary algebra as an application of the Baker-Pixley Theorem. This is followed by an overview of some of the practical applications of ternary algebras. We establish the a...

We define the following mappings: the characteristic function of a subset of a set, the inclusion function (injection or embedding), the projections from a Cartesian product onto its arguments and diagonal function (inclusion of a set into its Cartesian square). Some operations on functions are also defined: the products of two functions (the complex function and the more general product-functi...