20 search results - page 1 / 4 » Reachability in Unions of Commutative Rewriting Systems Is D... |
STACS
2007
Springer
13 years 11 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...
ENTCS
2002
13 years 4 months ago
2002
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing poli...
FSTTCS
2001
Springer
13 years 9 months ago
2001
Springer
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
RP
2010
Springer
13 years 2 months ago
2010
Springer
We adapt hypergraph rewriting system to a generalization of Vector Addition Systems with States (VASS) that we call vector addition systems with pairs (VASP). We give rewriting sys...
MFCS
2007
Springer
13 years 11 months ago
2007
Springer
We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...