scientific article; zbMATH DE number 1361503
From MaRDI portal
Publication:4699322
Recommendations
Cited in
(18)- Relating graph and term rewriting via Böhm models
- Drags: a compositional algebraic framework for graph rewriting
- Non-simplifying graph rewriting termination
- Graph reducibility of term rewriting systems
- scientific article; zbMATH DE number 1231490 (Why is no real title available?)
- scientific article; zbMATH DE number 1236372 (Why is no real title available?)
- Term graph rewriting
- GETGRATS: a summary of scientific results (with annotated bibliography)
- Essentials of term graph rewriting
- Kruskal's tree theorem for acyclic term graphs
- Relating graph and term rewriting via Böhm models
- Critical pairs in term graph rewriting
- Graph path orderings
- Complexity of acyclic term graph rewriting
- On termination of graph rewriting
- Termination of graph transformation systems using weighted subgraph counting
- Termination of graph transformation systems via generalized weighted type graphs
- Termination of graph transformation systems using weighted subgraph counting
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4699322)
