Ground Tree Rewriting Graphs of Bounded Tree Width

We analyze structural properties of ground tree rewriting graphs, generated by rewriting systems that perform replacements at the front of finite, ranked trees. The main result is that the class of ground tree rewriting graphs of bounded tree width exactly corresponds to the class of pushdown graphs. Furthermore we show that ground tree rewriting graphs of bounded clique width also have bounded tree width.

[1]  Achim Blumensath.  Prefix-Recognisable Graphs and Monadic Second-Order Logic , 2001 .

[2]  Christophe Morvan,et al.  On Rational Graphs , 2000, FoSSaCS.

[3]  Didier Caucal,et al.  On infinite transition graphs having a decidable monadic theory , 1996, Theor. Comput. Sci..

[4]  David E. Muller,et al.  The Theory of Ends, Pushdown Automata, and Second-Order Logic , 1985, Theor. Comput. Sci..

[5]  Klaus Barthelmann,et al.  When Can an Equational Simple Graph Be Generated by Hyperedge Replacement? , 1998, MFCS.

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

[7]  Rémi Gilleron,et al.  Proofs and Reachablity Problem for Ground Rewrite Systems , 1990, IMYCS.

[8]  Walter S. Brainerd,et al.  Tree Generating Regular Systems , 1969, Inf. Control..

[9]  Richard Mayr,et al.  Process rewrite systems , 1999, EXPRESS.

[10]  Bruno Courcelle,et al.  Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..

[11]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[12]  Didier Caucal,et al.  On the Regular Structure of Prefix Rewriting , 1990, Theor. Comput. Sci..

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

[14]  Achim Blumensath,et al.  Automatic structures , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[15]  Egon Wanke,et al.  The Tree-Width of Clique-Width Bounded Graphs Without Kn, n , 2000, WG.