Hyperedge replacement with rendezvous

DOI10.1007/3-540-56610-4_63zbMATH Open1497.68243OpenAlexW1507049957MaRDI QIDQ5044734FDOQ5044734

Authors: Gnanamalar David, Frank Drewes, Hans-Jörg Kreowski 

Publication date: 2 November 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56610-4_63

Recommendations

• scientific article; zbMATH DE number 522836
• Parallel high-level replacement systems
• scientific article; zbMATH DE number 176939
• scientific article; zbMATH DE number 4035178
• Node replacement in hypergraphs: simulation of hyperedge replacement, and decidability of confluence

Mathematics Subject Classification ID

Hypergraphs (05C65) Grammars and rewriting systems (68Q42)

Cites Work

• Title not available (Why is that?)
• Linear and Context-Free Graph Grammars
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Title not available (Why is that?)
• Plex languages
• Graph expressions and graph rewritings
• Amalgamation of graph transformations: a synchronization mechanism
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Metatheorems for decision problems on hyperedge replacement graph languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Contextual hyperedge replacement

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)