23201 search results - page 18 / 4641 » Rewriting Systems with Data |
TAPSOFT
1993
Springer
13 years 11 months ago
1993
Springer
Lamping's optimalgraph reduction technique for the -calculus is generalized to a new class of higher order rewriting systems, called Interaction Systems. Interaction Systems ...
ENTCS
2007
13 years 7 months ago
2007
Generation of labelled transition systems from system specifications is highly dependent on efficient rewriting (or related techniques). We give an account of the implementation ...
RTA
2011
Springer
12 years 10 months ago
2011
Springer
Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient compl...
CJ
2006
13 years 7 months ago
2006
Abstract. Uncertainty is an inherent property of all living systems. Curiously enough, computational models inspired by biological systems do not take, in general, under considerat...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...