478 search results - page 24 / 96 » Monads of Regular Theories |
66
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
This paper develops the basics of the theory of involutive categories and shows that such categories provide the natural setting in which to describe involutive monoids. It is sho...
77
Voted
ENTCS
2008
14 years 11 months ago
2008
CLF (the Concurrent Logical Framework) is a language for specifying and reasoning about concurrent systems. Its most significant feature is the first-class representation of concu...
135
Voted
MST
2011
14 years 5 months ago
2011
: We define a weighted monadic second order logic for unranked trees and the concept of weighted unranked tree automata, and we investigate the expressive power of these two conce...
69
Voted
FCT
2007
Springer
15 years 5 months ago
2007
Springer
We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infi...
82
Voted
FOIKS
2008
Springer
15 years 14 days ago
2008
Springer
We present a method for decomposing a hypergraph with certain regularities into smaller hypergraphs. By applying this to the set of all canonical covers of a given set of functiona...