String Rewriting Systems
String Rewriting System is a formal language mechanism consisting of a set of string rewriting rules that specify deterministic or nondeterministic transformations of strings by replacing substrings according to defined pattern-to-replacement mappings.
55
Publications
2.8K
Citations
81
Authors
57
Institutions
Publications per year
2017–2026
2
55
Choice Reviews Online · 1993 · 465 citations
On the regular structure of prefix rewriting
Didier Caucal · Theoretical Computer Science · 1992 · 159 citations
Inference of concise DTDs from XML data
Geert Jan Bex, Frank Neven, Thomas Schwentick et al. · Document Server@UHasselt (UHasselt) · 2006 · 123 citations · Full text
Inference of concise regular expressions and DTDs
Geert Jan Bex, Frank Neven, Thomas Schwentick et al. · ACM Transactions on Database Systems · 2010 · 103 citations
1–5 of 55
81
7
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 81
57
University of Kassel
Kassel, Germany
5 h-index
5 publications
72 citations
University of Kaiserslautern
Kaiserslautern, Germany
4 h-index
5 publications
108 citations

Leipzig University of Applied Sciences
Leipzig, Germany
4 h-index
5 publications
137 citations

Toho University
Tokyo, Japan
3 h-index
3 publications
38 citations
Albany State University
Albany, United States
3 h-index
3 publications
63 citations

Aarhus University
Aarhus, Denmark
3 h-index
9 publications
216 citations
University of Oxford
Oxford, United Kingdom
3 h-index
5 publications
120 citations
Kyoto Sangyo University
Kyoto, Japan
3 h-index
3 publications
38 citations
1–8 of 57
8 publications · 315 citations
8
h-index
2 publications · 65 citations
2
h-index
2 publications · 26 citations
2
h-index
2 publications · 100 citations
2
h-index
2 publications · 31 citations
2
h-index
1–5