113 search results - page 7 / 23 » Complete involutive rewriting systems |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function and a sketch of the proof that Tiling represents such a function. In this paper, we presen...
RTA
1997
Springer
13 years 12 months ago
1997
Springer
Series-parallel orders are de ned as the least class of partial orders containing the one-element order and closed by ordinal sum and disjoint union. From this inductive de nition,...
ICLP
1997
Springer
13 years 12 months ago
1997
Springer
We introduce novel, sound, complete, and locally optimal evaluation strategies for functional logic programming languages. Our strategies combine, in a non-trivial way, two landma...
FLOPS
2010
Springer
13 years 6 months ago
2010
Springer
Injectivity is one of the important properties for functions while it is undecidable in general and decidable for linear treeless functions. In this paper, we show new sufficient c...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...