The bounded degree problem for non-obstructing eNCE graph grammars

DOI10.1007/3-540-61228-9_89zbMath1412.68119OpenAlexW1563250037MaRDI QIDQ4645278

Egon Wanke, Konstantin Skodinis

Publication date: 10 January 2019

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

Full work available at URL: https://doi.org/10.1007/3-540-61228-9_89

zbMATH Keywords

labeled graphgraph grammaredge labelderivation stepnode label

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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
• Boundary graph grammars with dynamic edge relabeling
• On the structure of node-label-controlled graph languages
• Restrictions, extensions, and variations of NLC grammars
• Emptiness problems of eNCE graph languages
• Languages that Capture Complexity Classes

This page was built for publication: The bounded degree problem for non-obstructing eNCE graph grammars