882 search results - page 10 / 177 » A Taste of Rewrite Systems |
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...
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...
EPIA
1993
Springer
13 years 11 months ago
1993
Springer
Abstract. This work presents a constraint solver for the domain of rational trees. Since the problem is NP-hard the strategy used by the solver is to reduce as much as possible, in...
ACL
1992
13 years 8 months ago
1992
The class of linear context-free rewriting systems has been introduced as a generalization of a class of grammar formalisms known as mildly context-sensitive. The recognition prob...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Recent Microsoft security bulletins show that kernel vulnerabilities are becoming more and more important security threats. Despite the pretty extensive security mitigations many ...