Information and Computation
On the regular structure of prefix rewriting
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Information and Computation - Special issue on EXPRESS 1997
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
When Can an Equational Simple Graph Be Generated by Hyperedge Replacement?
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
On Infinite Transition Graphs Having a Decidable Monadic Theory
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Proofs and Reachablity Problem for Ground Rewrite Systems
Proceedings of the 6th International Meeting of Young Computer Scientists on Aspects and Prospects of Theoretical Computer Science
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
The Tree-Width of Clique-Width Bounded Graphs Without Kn, n
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
On Families of Graphs Having a Decidable First Order Theory with Reachability
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Rewrite-based verification of XML updates
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Transition graphs of rewriting systems over unranked trees
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
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.