882 search results - page 20 / 177 » A Taste of Rewrite Systems |
RTA
1993
Springer
15 years 4 months ago
1993
Springer
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ ...
73
Voted
CSL
2007
Springer
15 years 4 months ago
2007
Springer
We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewr...
116
Voted
FOSSACS
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Rewriting systems over adhesive categories have been recently introduced as a general framework which encompasses several rewriting-based computational formalisms, includ...
111
Voted
CATS
2006
15 years 1 months ago
2006
Learning from examples is an important characteristic feature of intelligence in both natural and artificial intelligent agents. In this paper, we study learnability of term rewri...
101
Voted
RTA
2010
Springer
15 years 4 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...