Pages that link to "Item:Q1059402"
From MaRDI portal
The following pages link to Restrictions on NLC graph grammars (Q1059402):
Displaying 16 items.
- 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)
- Graph theoretic closure properties of the family of boundary NLC graph languages (Q1084870) (← links)
- Combinatorial properties of boundary NLC graph languages (Q1089808) (← 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)
- On hyperedge replacement and BNLC graph grammars (Q1308742) (← links)
- A pumping lemma and the structure of derivations in the boundary NLC graph languages (Q1328510) (← links)
- The generating power of boundary NLC graph grammars and cycle graphs (Q1338850) (← links)
- Context-free graph languages of bounded degree are generated by apex graph grammars (Q1338891) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- On the inference of non-confluent NLC graph grammars (Q2843997) (← links)
- (Q3347320) (← links)
- Learning of restricted RNLC graph languages (Q6487959) (← links)