Galois-type connections and closure operations on preordered sets.
Gate circuits in the algebra of transients
We study simulation of gate circuits in the infinite algebra of transients recently introduced by Brzozowski and Ésik. A transient is a word consisting of alternating s and s; it represents a changing signal. In the algebra of transients, gates process transients instead of s and s. Simulation in this algebra is capable of counting signal changes and detecting hazards. We study two simulation algorithms: a general one that works with any initial state, and a special one that applies only if...
Gate circuits in the algebra of transients
We study simulation of gate circuits in the infinite algebra of transients recently introduced by Brzozowski and Ésik. A transient is a word consisting of alternating 0s and 1s; it represents a changing signal. In the algebra of transients, gates process transients instead of 0s and 1s. Simulation in this algebra is capable of counting signal changes and detecting hazards. We study two simulation algorithms: a general one that works with any initial state, and a special one that applies only if...
Generalized difference posets and orthoalgebras.
Generalized intervals and topology
Generalized ordering and partitions
Generating real maps on a biordered set.
Generating real maps on a biordered set
Several authors have defined operational quantities derived from the norm of an operator between Banach spaces. This situation is generalized in this paper and we present a general framework in which we derivate several maps from an initial one , where is a set endowed with two orders, and , related by certain conditions. We obtain only three different derivated maps, if the initial map is bounded and monotone.
Graph isomorphism of ordered sets
Graph isomorphisms of modular multilattices
Graph isomorphisms of partially ordered sets