On the power of local graph expansion grammars with and without additional restrictions

DOI10.1016/J.TCS.2024.114763MaRDI QIDQ6614008

Frank Drewes, Yannick Stade

Publication date: 7 October 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

graph grammargenerative powerhyperedge replacementgraph expansion grammar

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Contextual hyperedge replacement
• Hyperedge replacement: grammars and languages
• The string generating power of context-free hypergraph grammars
• A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars
• Grammatical picture generation. A tree-based approach. With CD-ROM.
• Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars
• Extending predictive shift-reduce parsing to contextual hyperedge replacement grammars
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• From Core OCL Invariants to Nested Graph Constraints
• Graph expressions and graph rewritings
• Algebraic automata and context-free sets
• Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power

This page was built for publication: On the power of local graph expansion grammars with and without additional restrictions

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