Pages that link to "Item:Q1148688"
From MaRDI portal
The following pages link to Restrictions, extensions, and variations of NLC grammars (Q1148688):
Displaying 32 items.
- The bounded degree problem for NLC grammars is decidable (Q579950) (← links)
- Note on node-rewriting graph grammars (Q796997) (← 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)
- Restrictions on NLC graph grammars (Q1059402) (← links)
- Graph theoretic closure properties of the family of boundary NLC graph languages (Q1084870) (← links)
- Combinatorial properties of boundary NLC graph languages (Q1089808) (← links)
- String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing (Q1089809) (← links)
- Handle NLC grammars and r. e. languages (Q1092670) (← links)
- A characterization of context-free string languages by directed node- label controlled graph grammars (Q1154289) (← links)
- Decision problems for node label controlled graph grammars (Q1155373) (← links)
- Graph grammars with neighbourhood-controlled embedding (Q1165019) (← links)
- Graph grammars with path-controlled embedding (Q1177180) (← links)
- Separating \(k\)-separated eNCE graph languages (Q1314371) (← links)
- A pumping lemma and the structure of derivations in the boundary NLC graph languages (Q1328510) (← links)
- The complexity of connectivity problems on context-free graph languages (Q1333400) (← links)
- \(k\)-NLC graphs and polynomial algorithms (Q1336631) (← links)
- The generating power of boundary NLC graph grammars and cycle graphs (Q1338850) (← links)
- The bounded degree problem for eNCE graph grammars (Q1363781) (← links)
- A hierarchy of eNCE families of graph languages (Q1389767) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- Eigenvalue location in graphs of small clique-width (Q1625480) (← 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)
- Representing graph families with edge grammars (Q1801468) (← links)
- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages (Q1854438) (← links)
- Node replacements in embedding normal form. (Q1872709) (← links)
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting (Q1960412) (← links)
- Node replacement graph grammars with dynamic node relabeling (Q2342679) (← links)
- Node-label controlled graph grammars with context conditions (Q3309082) (← links)
