831 search results - page 119 / 167 » Coalgebraic Correspondence Theory |
105
Voted
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Several analog-to-digital conversion methods for bandlimited signals used in applications, such as quantization schemes, employ coarse quantization coupled with oversampling. The...
DM
2010
14 years 12 months ago
2010
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has siz...
ENTCS
2008
14 years 12 months ago
2008
Inspired by the properties of the refinement development of the Mondex Electronic Purse, we view an atomic action as a family of transitions with a common before-state, and differ...
CORR
2006
Springer
14 years 12 months ago
2006
Springer
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...