A simple notion of monograph is proposed that generalizes the standard notion of graph and can be drawn consistently with them. It is shown that monadic many-sorted signatures can be represented by monographs, and that the corresponding algebras are isomorphic to the monographs typed by the corresponding signature monograph. Monographs therefore provide a simple unifying framework for working with monadic algebras. The simplicity of monographs is illustrated by deducing some of their categorial properties from those of sets
We present the algebraic representation and basic algorithms for MultiAspect Graphs (MAGs). A MAG is...
This book introduces the study of algebra induced by combinatorial objects called directed graphs. T...
AbstractThe same properties of graphs of degree at most k, where k is a fixed integer, can be expres...
A simple notion of monograph is proposed that generalizes the standard notion of graph and can be dr...
International audienceDoes a graph necessarily have nodes? May an edge be adjacent to itself and be ...
Summary. The basic purpose of the paper is to prepare preliminaries of the theory of many sorted alg...
Summary. The concept of characterizing of partial algebras by many sorted signature is introduced, i...
The object of study of the thesis is the notion of monadic bounded algebras (shortly, MBA's). These ...
AbstractGraphs are finite and handled as relational structures. We give some answers to the followin...
Multi-algebras allow to model nondeterminism in an algebraic framework by interpreting operators as...
AbstractThis paper studies several applications of the notion of a presentation of a functor by oper...
Summary. The concept of characterizing of partial algebras by many sorted signature is introduced, i...
We present a categorical characterization of term graphs (i.e., finite, directed acyclic graphs labe...
This paper introduces guarded and strongly guarded monads as a unified model of a variety of differe...
This paper studies several applications of the notion of a presentation of a functor by operations a...
We present the algebraic representation and basic algorithms for MultiAspect Graphs (MAGs). A MAG is...
This book introduces the study of algebra induced by combinatorial objects called directed graphs. T...
AbstractThe same properties of graphs of degree at most k, where k is a fixed integer, can be expres...
A simple notion of monograph is proposed that generalizes the standard notion of graph and can be dr...
International audienceDoes a graph necessarily have nodes? May an edge be adjacent to itself and be ...
Summary. The basic purpose of the paper is to prepare preliminaries of the theory of many sorted alg...
Summary. The concept of characterizing of partial algebras by many sorted signature is introduced, i...
The object of study of the thesis is the notion of monadic bounded algebras (shortly, MBA's). These ...
AbstractGraphs are finite and handled as relational structures. We give some answers to the followin...
Multi-algebras allow to model nondeterminism in an algebraic framework by interpreting operators as...
AbstractThis paper studies several applications of the notion of a presentation of a functor by oper...
Summary. The concept of characterizing of partial algebras by many sorted signature is introduced, i...
We present a categorical characterization of term graphs (i.e., finite, directed acyclic graphs labe...
This paper introduces guarded and strongly guarded monads as a unified model of a variety of differe...
This paper studies several applications of the notion of a presentation of a functor by operations a...
We present the algebraic representation and basic algorithms for MultiAspect Graphs (MAGs). A MAG is...
This book introduces the study of algebra induced by combinatorial objects called directed graphs. T...
AbstractThe same properties of graphs of degree at most k, where k is a fixed integer, can be expres...