Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power

DOI10.1007/978-3-031-09843-7_1zbMath1514.6809MaRDI QIDQ6487303

Mark Minas, Berthold Hoffmann, Frank Drewes

Publication date: 7 December 2022

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Transduction from trees to graphs through folding

Cites Work

• Contextual hyperedge replacement
• Hyperedge replacement: grammars and languages
• Metatheorems for decision problems on hyperedge replacement graph languages
• A navigational logic for reasoning about graph properties
• Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars
• Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
• Fundamentals of algebraic graph transformation
• Predictive Top-Down Parsing for Hyperedge Replacement Grammars
• The intrinsically exponential complexity of the circularity problem for attribute grammars
• Handbook of Graph Grammars and Computing by Graph Transformation
• Predictive Shift-Reduce Parsing for Hyperedge Replacement Grammars
• Semantics of context-free languages
• Semantics of context-free languages: Correction

This page was built for publication: Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power