Decision problems for edge grammars

DOI10.1007/3-540-58338-6_75zbMath1493.68172OpenAlexW1595868096MaRDI QIDQ5096886

Juergen Dassow

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58338-6_75

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The bounded degree problem for NLC grammars is decidable
• Hyperedge replacement: grammars and languages
• Decision problems and regular chain code picture languages
• An undecidable problem about rational sets and contour words of polyominoes
• Graph theoretic closure properties of the family of boundary NLC graph languages
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Metatheorems for decision problems on hyperedge replacement graph languages
• Decision problems for node label controlled graph grammars
• Representing graph families with edge grammars
• A comparison of compatible, finite, and inductive graph properties
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Neighborhood-uniform NLC grammars
• Efficient decision procedures for graph properties on context-free graph languages

This page was built for publication: Decision problems for edge grammars