Foundations of Software Science and Computation Structures

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.

[1]  Sophie Tison,et al.  Decidability of the Confluence of Ground Term Rewriting Systems , 1985, LICS.

[2]  Sophie Tison,et al.  Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems , 1990, Inf. Comput..

[3]  Sophie Tison,et al.  The theory of ground rewrite systems is decidable , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[4]  Jean-Claude Raoult,et al.  A survey of tree transductions , 1992, Tree Automata and Languages.

[5]  Jean-Claude Raoult.  Rational tree relations , 1997 .

[6]  Teodor Knapik,et al.  A String-Rewriting Characterization of Muller and Schupp's Context-Free Graphs , 1998, FSTTCS.

[7]  Sándor Vágvölgyi,et al.  Linear Generalized Semi-Monadic Rewrite Systems Effectively Preserve Recognizability , 1998, Theor. Comput. Sci..

[8]  Hiroyuki Seki,et al.  Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability , 2000, RTA.

[9]  Didier Caucal.  On Word Rewriting Systems Having a Rational Derivation , 2000, FoSSaCS.

[10]  Marcus Nilsson,et al.  Regular Model Checking , 2000, CAV.

[11]  Pascal Weil,et al.  Rationality in Algebras with a Series Operation , 2002, Inf. Comput..

[12]  Christof Löding.  Ground Tree Rewriting Graphs of Bounded Tree Width , 2002, STACS.

[13]  Didier Caucal,et al.  A Chomsky-Like Hierarchy of Infinite Graphs , 2002, MFCS.

[14]  Thomas Colcombet.  On Families of Graphs Having a Decidable First Order Theory with Reachability , 2002, ICALP.

[15]  Tayssir Touili,et al.  Extrapolating Tree Transformations , 2002, CAV.

[16]  Parosh Aziz Abdulla,et al.  Regular Tree Model Checking , 2002, CAV.