HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting
From MaRDI portal
Publication:4645289
DOI10.1007/3-540-61228-9_100zbMath1412.68106OpenAlexW1700203549MaRDI QIDQ4645289
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_100
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of regular DNLC graph languages
- Boundary graph grammars with dynamic edge relabeling
- 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
- On the structure of node-label-controlled graph languages
- Restrictions, extensions, and variations of NLC grammars
- Hypergraph languages of bounded degree
- Linear graph grammars: Power and complexity
- The complexity of graph languages generated by hyperedge replacement
- Handle-rewriting hypergraph grammars
- Complexity of boundary graph languages
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
- Graph expressions and graph rewritings