A hierarchy of eNCE families of graph languages
From MaRDI portal
Publication:1389767
DOI10.1016/S0304-3975(97)86542-5zbMath0893.68089MaRDI QIDQ1389767
Publication date: 30 June 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
On spectra of sentences of monadic second order logic with counting, Algorithmic uses of the Feferman-Vaught theorem, On the structure of linear apex NLC graph grammars, HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting, Quasi-rocking real-time pushdown automata, Separation results for separated apex NLC and NCE graph languages, Double Greibach operator grammars, Node replacement graph grammars with dynamic node relabeling
Cites Work
- 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
- On the membership problem for regular DNLC grammars
- Graph theoretic closure properties of the family of boundary NLC graph languages
- String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
- Apex graph grammars and attribute grammars
- Nonterminal bounded NLC graph grammars
- On the structure of node-label-controlled graph languages
- Restrictions, extensions, and variations of NLC grammars
- Graph grammars with neighbourhood-controlled embedding
- Linear graph grammars: Power and complexity
- Node replacement graph languages squeezed with chains, trees, and forests
- On sequential and parallel node-rewriting graph grammars
- Complexity of boundary graph languages
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
