Name
Abstract | ||
|---|---|---|
Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down systems, which generalize similar classes on words. Our aim is to study the derivation relation of such systems (i.e. the reflexive and transitive closure of their rewriting relation) and, if possible, to provide a finite mechanism characterizing it. Using a notion of rational relations based on finite graph grammars, we show that the derivation of any bottom-up, top-down or suffix systems is rational, while it can be non recursive for prefix systems. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-24727-2_27 | LECTURE NOTES IN COMPUTER SCIENCE |
Keywords | DocType | Volume |
bottom up,top down,transitive closure | Journal | 2987 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
8 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Antoine Meyer | 1 | 79 | 4.69 |
| Rennes Liafa | 2 | 0 | 0.34 |