The equivalence of boundary and confluent graph grammars on graph languages of bounded degree

DOI10.1007/3-540-53904-2_106MaRDI QIDQ5055770zbMATH OpenOpenAlexFDO

Authors Franz J. Brandenburg

Publication date 9 December 2022

Published in Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-53904-2_106

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• A comparison of boundary graph grammars and context-free hypergraph grammars
• The bounded degree problem for eNCE graph grammars
• Boundary graph grammars with dynamic edge relabeling
• scientific article; zbMATH DE number 17539
• scientific article; zbMATH DE number 219258

Cites work

• A comparison of boundary graph grammars and context-free hypergraph grammars
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Boundary graph grammars with dynamic edge relabeling
• Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
• Combinatorial properties of boundary NLC graph languages
• Complexity of boundary graph languages
• Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
• Handle-rewriting hypergraph grammars
• scientific article; zbMATH DE number 4049100 (Why is no real title available?)
• scientific article; zbMATH DE number 4051027 (Why is no real title available?)
• scientific article; zbMATH DE number 17539 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• The bounded degree problem for NLC grammars is decidable

Cited in

(8)

• Hypergraph languages of bounded degree
• Monadic second-order definable graph transductions: a survey
• The bounded degree problem for eNCE graph grammars
• The bounded degree problem for non-obstructing eNCE graph grammars
• Drawing graphs with attribute graph grammars
• A Greibach normal form for context-free graph grammars
• Boundary graph grammars with dynamic edge relabeling
• A comparison of boundary graph grammars and context-free hypergraph grammars

This page was built for publication: The equivalence of boundary and confluent graph grammars on graph languages of bounded degree

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