Galois connections as left adjoint maps
Galois lattice as a framework to specify building class hierarchies algorithms
Galois Lattice as a Framework to Specify Building Class Hierarchies Algorithms
In the context of object-oriented systems, algorithms for building class hierarchies are currently receiving much attention. We present here a characterization of several global algorithms. A global algorithm is one which starts with only the set of classes (provided with all their properties) and directly builds the hierarchy. The algorithms scrutinized were developped each in a different framework. In this survey, they are explained in a single framework, which takes advantage of a substructure...
Galois theory for groups
Galois triangle theory for direct summands of modules
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...
General algebraic geometry and formal concept analysis.
Generalization of ideal topology in chains
Generalized difference posets and orthoalgebras.
Generalized intervals and topology
Generalized ordering and partitions
Generating functions for permutations which contain a given descent set.
Generating functions for Wilf equivalence under generalized factor order.
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.
Genomorphisms of lattices and semilattices
Geometrically constructed bases for homology of non-crossing partition lattices.
GMV-algebras and meet-semilattices with sectionally antitone permutations