Ground tree rewriting graphs of bounded tree width

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2285, Issue , 2002, Pages 559-570

  Löding, Christof ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; GRAPHIC METHODS;

CLIQUE-WIDTH; PUSHDOWN GRAPHS; REWRITING SYSTEMS; TREE REWRITING; TREE-WIDTH;

TREES (MATHEMATICS);

SYSTEMS; TREES;

EID: 84937402600     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45841-7_46     Document Type: Conference Paper

References (14)

1. 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.
2. Achim Blumensath and Erich Grädel. Automatic structures. In Proceedings of LICS’00, pages 51–62. IEEE Computer Society Press, 2000.
3. Achim Blumensath. Prefix-recognizable graphs and monadic second order logic. Technical Report AIB-2001-06, RWTH Aachen, May 2001.
4. Walter S. Brainerd. Tree generating regular systems. Information and Control, 14:217–231, 1969.
5. D. Caucal. On the regular structure of prefix rewriting. Theoretical Computer Science, 106(1):61–86, 1992.
6. Didier Caucal. On infinite transition graphs having a decidable monadic theory. In Proceedings of ICALP’96, volume 1099 of LNCS. Springer-Verlag, 1996.
7. J.L. Coquid´e 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.
8. Bruno Courcelle and Stephan Olariu. Upper bounds to the clique width of graphs. Discrete Applied Mathematics, 101:77–114, 2000.
9. 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.
10. Reinhard Diestel. Graph Theory. Springer, second edition, 2000. 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.
11. 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.
12. Richard Mayr. Process rewrite systems. Information and Computation, 156(1–2):264–286, 2000.
13. Christophe Morvan. On rational graphs. In Proceedings of FoSSaCS’99, volume 1784 of LNCS, pages 252–266. Springer, 1999.
14. David E. Muller and Paul E. Schupp. The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science, 37:51–75, 1985.