Pages that link to "Item:Q1165019"
From MaRDI portal
The following pages link to Graph grammars with neighbourhood-controlled embedding (Q1165019):
Displayed 28 items.
- On the structure of linear apex NLC graph grammars (Q441855) (← links)
- Nonterminal separation in graph grammars (Q804300) (← links)
- Boundary graph grammars with dynamic edge relabeling (Q909478) (← links)
- Results of NLC grammars with one-letter terminal alphabets (Q909481) (← links)
- Edge-label controlled graph grammars (Q909484) (← links)
- A comparison of boundary graph grammars and context-free hypergraph grammars (Q918718) (← links)
- Restrictions on NLC graph grammars (Q1059402) (← links)
- Handle NLC grammars and r. e. languages (Q1092670) (← links)
- Nonterminal bounded NLC graph grammars (Q1114416) (← links)
- Power properties of NLC graph grammars with a polynomial membership problem (Q1129012) (← links)
- Graph grammars with path-controlled embedding (Q1177180) (← links)
- Order independent NCE grammars recognized in polynomial time (Q1182091) (← links)
- Separating \(k\)-separated eNCE graph languages (Q1314371) (← links)
- \(k\)-NLC graphs and polynomial algorithms (Q1336631) (← links)
- A hierarchy of eNCE families of graph languages (Q1389767) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- Graph grammars according to the type of input and manipulated data: a survey (Q1750316) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- Linear graph grammars: Power and complexity (Q1825679) (← links)
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting (Q1960412) (← links)
- Graph transformation through graph surfing in reaction systems (Q2011207) (← links)
- Node replacement graph grammars with dynamic node relabeling (Q2342679) (← links)
- Complexity of boundary graph languages (Q3479528) (← links)
- Non-size increasing graph rewriting for natural language processing (Q4585012) (← links)
- Separation results for separated apex NLC and NCE graph languages (Q5946057) (← links)
- Node rewriting in graphs and hypergraphs: A categorical framework (Q5958766) (← links)
- A uniform approach to graph rewriting: The pullback approach (Q6122215) (← links)
- Exponential time analysis of confluent and boundary eNCE graph languages (Q6184368) (← links)