Separation results for separated apex NLC and NCE graph languages
From MaRDI portal
Publication:5946057
DOI10.1006/jcss.2001.1749zbMath0983.68107OpenAlexW2067343007MaRDI QIDQ5946057
Publication date: 14 October 2001
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.2001.1749
Related Items (2)
On the structure of linear apex NLC graph grammars ⋮ Node replacement graph grammars with dynamic node relabeling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonterminal separation in graph grammars
- 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
- Apex graph grammars and attribute grammars
- Nonterminal bounded NLC graph grammars
- Metatheorems for decision problems on hyperedge replacement graph languages
- On the structure of node-label-controlled graph languages
- Restrictions, extensions, and variations of NLC grammars
- Graph grammars with neighbourhood-controlled embedding
- Separating \(k\)-separated eNCE graph languages
- A hierarchy of eNCE families of graph languages
- Linear graph grammars: Power and complexity
- Node replacement graph languages squeezed with chains, trees, and forests
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
- Handle-rewriting hypergraph grammars
- On sequential and parallel node-rewriting graph grammars
- Complexity of boundary graph languages
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
- Graph expressions and graph rewritings
- Handbook of Graph Grammars and Computing by Graph Transformation
This page was built for publication: Separation results for separated apex NLC and NCE graph languages
