Pages that link to "Item:Q1084870"
From MaRDI portal
The following pages link to Graph theoretic closure properties of the family of boundary NLC graph languages (Q1084870):
Displaying 22 items.
- The bounded degree problem for NLC grammars is decidable (Q579950) (← 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)
- A comparison of boundary graph grammars and context-free hypergraph grammars (Q918718) (← links)
- Combinatorial properties of boundary NLC graph languages (Q1089808) (← links)
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars (Q1102759) (← links)
- Metatheorems for decision problems on hyperedge replacement graph languages (Q1121675) (← links)
- Algorithms for graph problems on BNLC structured garphs (Q1175948) (← links)
- On hyperedge replacement and BNLC graph grammars (Q1308742) (← 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)
- The generating power of boundary NLC graph grammars and cycle graphs (Q1338850) (← links)
- A hierarchy of eNCE families of graph languages (Q1389767) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- Linear graph grammars: Power and complexity (Q1825679) (← links)
- Node replacement graph languages squeezed with chains, trees, and forests (Q1891164) (← links)
- A normal form problem for unlabeled boundary NLC graph languages (Q1898472) (← links)
- A hierarchy of the class of apex NLC graph languages by bounds on the number of nonterminal nodes in productions (Q1920234) (← links)
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting (Q1960412) (← links)
- Decision problems for edge grammars (Q5096886) (← links)