23201 search results - page 105 / 4641 » Rewriting Systems with Data |
127
click to vote
MST
2002
15 years 5 months ago
2002
Programmed mutagenesis is a DNA computing system that uses cycles of DNA annealing, ligation, and polymerization to implement programatic rewriting of DNA sequences. We report that...
144
click to vote
PPDP
2007
Springer
15 years 11 months ago
2007
Springer
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
158
click to vote
CADE
2010
Springer
15 years 4 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
138
click to vote
DBPL
2007
Springer
15 years 11 months ago
2007
Springer
BPQL is a novel query language for querying business process specifications, introduced recently in [5, 6]. It is based on an intuitive business processes as rewriting systems, an...
143
click to vote
FROCOS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...