Filtering hyperedge-replacement languages through compatible properties

DOI10.1007/3-540-52292-1_8MaRDI QIDQ4694766zbMATH OpenFDO

Authors Annegret Habel, Hans-Jörg Kreowski

Publication date 29 June 1993

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

Full work available at URL https://doi.org/10.1007/3-540-52292-1_8

zbMATH Keywords

compatibilitycompatible propertygenerative grammarhyperedge-replacement languagehypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Grammars and rewriting systems (68Q42) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 4087049
• scientific article; zbMATH DE number 4160146
• scientific article; zbMATH DE number 809155
• Hyperedge replacement: grammars and languages
• scientific article; zbMATH DE number 4062634

Cited in

(7)

• Integration of graph constraints into graph grammars
• A comparison of compatible, finite, and inductive graph properties
• Theoretical properties in hypergraphs
• scientific article; zbMATH DE number 4160146 (Why is no real title available?)
• scientific article; zbMATH DE number 4087049 (Why is no real title available?)
• Contextual hyperedge replacement
• Graph-theoretic properties compatible with graph derivations

This page was built for publication: Filtering hyperedge-replacement languages through compatible properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4694766)