Graph grammars with neighbourhood-controlled embedding
From MaRDI portal
Publication:1165019
DOI10.1016/0304-3975(82)90088-3zbMATH Open0486.68075OpenAlexW2013956597MaRDI QIDQ1165019FDOQ1165019
Authors: Dirk Janssens, Grzegorz Rozenberg 
Publication date: 1982
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(82)90088-3
classification of embedding mechanismsgrammars generating sets of node-labelled undirected graphsgraph-language generating power of graph grammarsnode rewriting graph grammars
Cites Work
- Title not available (Why is that?)
- Restrictions, extensions, and variations of NLC grammars
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Context-free graph grammars
- Separable graphs, planar graphs and web grammars
- Title not available (Why is that?)
- Web grammars and several graphs
Cited In (29)
- Complexity of boundary graph languages
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
- Edge-label controlled graph grammars
- Graph grammars with path-controlled embedding
- \(k\)-NLC graphs and polynomial algorithms
- Node replacement graph grammars with dynamic node relabeling
- Graph transformation through graph surfing in reaction systems
- Graph grammars according to the type of input and manipulated data: a survey
- On the structure of linear apex NLC graph grammars
- Separation results for separated apex NLC and NCE graph languages
- Nonterminal separation in graph grammars
- Exponential time analysis of confluent and boundary eNCE graph languages
- A comparison of boundary graph grammars and context-free hypergraph grammars
- Non-size increasing graph rewriting for natural language processing
- Boundary graph grammars with dynamic edge relabeling
- Power properties of NLC graph grammars with a polynomial membership problem
- Node rewriting in graphs and hypergraphs: A categorical framework
- Separating \(k\)-separated eNCE graph languages
- A hierarchy of eNCE families of graph languages
- Linear graph grammars: Power and complexity
- Results of NLC grammars with one-letter terminal alphabets
- Order independent NCE grammars recognized in polynomial time
- Restrictions on NLC graph grammars
- Handle NLC grammars and r. e. languages
- Nonterminal bounded NLC graph grammars
- Finite graph automata for linear and boundary graph languages
- Generating irregular partitionable data structures
- A uniform approach to graph rewriting: The pullback approach
- Node rewriting in hypergraphs
This page was built for publication: Graph grammars with neighbourhood-controlled embedding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1165019)
