Advertisement

Ground Tree Rewriting Graphs of Bounded Tree Width

  • Christof Löding
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2285)

Abstract

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.

Keywords

Normal Form Graph Isomorphism Rational Graph Reachability Problem Ground Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bar98]
    Klaus Barthelmann. When can an equational simple graph be generated by hyperedge replacement? In Proceedings of MFCS’ 98, volume 1450 of LNCS, pages 543–552. Springer-Verlag, 1998.Google Scholar
  2. [BG00]
    Achim Blumensath and Erich Grädel. Automatic structures. In Proceedings of LICS’ 00, pages 51–62. IEEE Computer Society Press, 2000.Google Scholar
  3. [Blu01]
    Achim Blumensath. Prefix-recognizable graphs and monadic second order logic. Technical Report AIB-2001-06, RWTH Aachen, May 2001.Google Scholar
  4. [Bra69]
    Walter S. Brainerd. Tree generating regular systems. Information and Control, 14:217–231, 1969.zbMATHCrossRefMathSciNetGoogle Scholar
  5. [Cau92]
    D. Caucal. On the regular structure of prefix rewriting. Theoretical Computer Science, 106(1):61–86, 1992.CrossRefMathSciNetGoogle Scholar
  6. [Cau96]
    Didier Caucal. On infinite transition graphs having a decidable monadic theory. In Proceedings of ICALP’ 96, volume 1099 of LNCS. Springer-Verlag, 1996.Google Scholar
  7. [CG90]
    J.L. Coquidé and R. Gilleron. Proofs and reachability problem for ground rewrite systems. In Aspects and Prospects of Theoretical Computer Science, volume 464 of LNCS, pages 120–129. Springer, 1990.Google Scholar
  8. [CO00]
    Bruno Courcelle and Stephan Olariu. Upper bounds to the clique width of graphs. Discrete Applied Mathematics, 101:77–114, 2000.zbMATHCrossRefMathSciNetGoogle Scholar
  9. [DHLT90]
    Max Dauchet, Thierry Heuillard, Pierre Lescanne, and Sophie Tison. Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems. Information and Computation, 88(2):187–201, October 1990.zbMATHCrossRefMathSciNetGoogle Scholar
  10. [Die00]
    Reinhard Diestel. Graph Theory. Springer, second edition, 2000.Google Scholar
  11. [DT90]
    Max Dauchet and Sophie Tison. The theory of ground rewrite systems is decidable. In Proceedings of LICS’ 90, pages 242–248. IEEE Computer Society Press, 1990.Google Scholar
  12. [GW00]
    Frank Gurski and Egon Wanke. The tree-width of clique-width bounded graphs without Kn,n. In Proceedings of WG 2000, volume 1928 of LNCS, pages 196–205. Springer-Verlag, 2000.Google Scholar
  13. [May00]
    Richard Mayr. Process rewrite systems. Information and Computation, 156(1–2):264–286, 2000.zbMATHCrossRefMathSciNetGoogle Scholar
  14. [Mor99]
    Christophe Morvan. On rational graphs. In Proceedings of FoSSaCS’ 99, volume 1784 of LNCS, pages 252–266. Springer, 1999.Google Scholar
  15. [MS85]
    David E. Muller and Paul E. Schupp. The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science, 37:51–75, 1985.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Christof Löding
    • 1
  1. 1.RWTH AachenAachen

Personalised recommendations