Hyperedge replacement with rendezvous
From MaRDI portal
Publication:5044734
Recommendations
Cites work
- Amalgamation of graph transformations: a synchronization mechanism
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- From parallel graph grammars to parallel high-level replacement systems
- Graph expressions and graph rewritings
- scientific article; zbMATH DE number 4035178 (Why is no real title available?)
- scientific article; zbMATH DE number 4049016 (Why is no real title available?)
- scientific article; zbMATH DE number 4049108 (Why is no real title available?)
- scientific article; zbMATH DE number 4060749 (Why is no real title available?)
- scientific article; zbMATH DE number 3480114 (Why is no real title available?)
- scientific article; zbMATH DE number 3802813 (Why is no real title available?)
- Linear and Context-Free Graph Grammars
- Metatheorems for decision problems on hyperedge replacement graph languages
- Parallel hyperedge replacement
- Plex languages
- Programming with very large graphs
Cited in
(3)
This page was built for publication: Hyperedge replacement with rendezvous
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5044734)