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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
Achim Blumensath and Erich Grädel. Automatic structures. In Proceedings of LICS’ 00, pages 51–62. IEEE Computer Society Press, 2000.
Achim Blumensath. Prefix-recognizable graphs and monadic second order logic. Technical Report AIB-2001-06, RWTH Aachen, May 2001.
Walter S. Brainerd. Tree generating regular systems. Information and Control, 14:217–231, 1969.
D. Caucal. On the regular structure of prefix rewriting. Theoretical Computer Science, 106(1):61–86, 1992.
Didier Caucal. On infinite transition graphs having a decidable monadic theory. In Proceedings of ICALP’ 96, volume 1099 of LNCS. Springer-Verlag, 1996.
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.
Bruno Courcelle and Stephan Olariu. Upper bounds to the clique width of graphs. Discrete Applied Mathematics, 101:77–114, 2000.
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.
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.
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.
Richard Mayr. Process rewrite systems. Information and Computation, 156(1–2):264–286, 2000.
Christophe Morvan. On rational graphs. In Proceedings of FoSSaCS’ 99, volume 1784 of LNCS, pages 252–266. Springer, 1999.
David E. Muller and Paul E. Schupp. The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science, 37:51–75, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Löding, C. (2002). Ground Tree Rewriting Graphs of Bounded Tree Width. In: Alt, H., Ferreira, A. (eds) STACS 2002. STACS 2002. Lecture Notes in Computer Science, vol 2285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45841-7_46
Download citation
DOI: https://doi.org/10.1007/3-540-45841-7_46
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43283-8
Online ISBN: 978-3-540-45841-8
eBook Packages: Springer Book Archive