Pullback rewriting and applications
From MaRDI portal
Recommendations
- Applications and extensions of context-sensitive rewriting
- Pullback as a generic graph rewriting mechanism
- scientific article; zbMATH DE number 1189298
- Partial pullback complement rewriting
- A theory of binding structures and applications to rewriting
- Automata, Languages and Programming
- Lazy rewriting and context-sensitive rewriting
- Rewrite strategies in the rewriting calculus
- Modular rewriting semantics in practice
- Structures for abstract rewriting
Cites work
- A category-theoretical approach to vertex replacement: the generation of infinite graphs
- scientific article; zbMATH DE number 1189298 (Why is no real title available?)
- scientific article; zbMATH DE number 3633737 (Why is no real title available?)
- scientific article; zbMATH DE number 1231478 (Why is no real title available?)
- scientific article; zbMATH DE number 1504831 (Why is no real title available?)
- On the structure of node-label-controlled graph languages
- Pullback as a generic graph rewriting mechanism
Cited in
(13)- Graph rewriting and relabeling with PBPO\textsuperscript{+}
- Partial pullback complement rewriting
- Pullback Grammars Are Context-Free
- scientific article; zbMATH DE number 1231478 (Why is no real title available?)
- scientific article; zbMATH DE number 1504831 (Why is no real title available?)
- GETGRATS: a summary of scientific results (with annotated bibliography)
- Context-free hypergraph grammars with node rewriting
- Patch graph rewriting
- Pullback as a generic graph rewriting mechanism
- Node rewriting in graphs and hypergraphs: A categorical framework
- A uniform approach to graph rewriting: The pullback approach
- Node rewriting in hypergraphs
- A theory of binding structures and applications to rewriting
This page was built for publication: Pullback rewriting and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4923531)
