Rewriting Systems
Rewriting Systems is a formal computational model consisting of a set of rules for transforming symbolic expressions, distinguished by its mechanistic application of substitution rules to rewrite terms in a deterministic or nondeterministic manner according to specified patterns.
858
Publications
33.8K
Citations
1.2K
Authors
489
Institutions
Publications per year
2017–2026
60
Parents
858
Orderings for term-rewriting systems
Nachum Dershowitz · Theoretical Computer Science · 1982 · 607 citations
Choice Reviews Online · 1993 · 465 citations
Tree-Manipulating Systems and Church-Rosser Theorems
Barry K. Rosen · Journal of the ACM · 1973 · 352 citations · Full text
1–5 of 858
1.2K
24
h-index
Institut national de recherche en sciences et technologies du numérique, France
17 publications · 722 citations
13
h-index
13
h-index
12
h-index
12
h-index
1–5 of 1.2K
489
University of Illinois Urbana-Champaign
Urbana, United States
29 h-index
73 publications
3.9K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
27 h-index
97 publications
4K citations

Centre National de la Recherche Scientifique
Paris, France
25 h-index
77 publications
3.4K citations
Laboratoire Lorrain de Recherche en Informatique et ses Applications
Nancy, France
17 h-index
48 publications
1.6K citations
Utrecht University
Utrecht, The Netherlands
17 h-index
25 publications
1.2K citations

University of Pisa
Pisa, Italy
16 h-index
38 publications
1K citations
Universitat Politècnica de València
Valencia, Spain
16 h-index
36 publications
1.2K citations
Universidad Complutense de Madrid
Madrid, Spain
15 h-index
33 publications
1.6K citations
1–8 of 489
72 publications · 3.9K citations
34
h-index
ENTCS · 92 publications · 2.6K citations
28
h-index
18 publications · 706 citations
15
h-index
21 publications · 798 citations
15
h-index
Repository · 23 publications · 409 citations
13
h-index
1–5