Sciweavers

1385 search results - page 31 / 277
» Natural Rewriting for General Term Rewriting Systems
Sort
View
MCMASTER
1993
15 years 6 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
ICGI
2004
Springer
15 years 7 months ago
Representing Languages by Learnable Rewriting Systems
Rémi Eyraud, Colin de la Higuera, Jean-Chri...
ENTCS
2002
76views more  ENTCS 2002»
15 years 1 months ago
Four equivalent equivalences of reductions
Two co-initial reductions in a term rewriting system are said to be equivalent if they perform the same steps, albeit maybe in a different order. We present four characterisations...
Vincent van Oostrom, Roel C. de Vrijer
ENTCS
2007
128views more  ENTCS 2007»
15 years 1 months ago
Rewriting-Based Access Control Policies
In this paper we propose a formalization of access control policies based on term rewriting. The state of the system to which policies are enforced is represented as an algebraic ...
Anderson Santana de Oliveira