Unate function

Known as: Binate Function (Computing), Binate function

A unate function is a type of boolean function which has monotonic properties.They have been studied extensively in switching theory. A function is…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

We present an adaptive tester for the unateness property of Boolean functions. Given a function $f:\{0,1\}^n \to \{0,1\}$ the…

2015

2015

Boolean formulas have been widely studied in the field of learning theory. We focus on the model of learning with queries, and…

1996

We consider delay testing of a specific class of logic circuits, the so called 'unate gate networks (UGNs)', which are of…

1993

Multiple-valued Kleenean functions that are models of a Kleene algebra and are logic functions expressed by logic formulas…

1991

Multiple-valued Kleenean functions are represented by multiple-valued AND, OR, NOT, variables and constants. In their previous…

1988

The generation of a universal test set (UTS) for unate functions is used as a starting point. This test set is complete and…

1977

The total and local unateness of discrete and of switching functions are studied from a theoretical point of view. One shows that…

1974

In this paper the problems associated with the minimal realization of synchronous sequential machines by unate cellular cascades…

1971

A model of combinational switching circuits used as information processors is described. A set of entropies (in the information…