The XPath language incorporates powerful primitives for formulating queries containing nested subexpressions which are existentially or universally quantified. However, even the b...
Abstract. Symbolic methods for investigating Hopf bifurcation problems of vector fields arising in the context of algebraic biology have recently obtained renewed attention. Howev...
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
CTC is a toy cipher designed in order to assess the strength of algebraic attacks. While the structure of CTC is deliberately weak with respect to algebraic attacks, it was claimed...
The aim of this paper is an integration of graph grammars with different kinds of behavioural constraints, in particular with temporal logic constraints. Since the usual algebraic ...
Reiko Heckel, Hartmut Ehrig, Uwe Wolter, Andrea Co...