Pages that link to "Item:Q1089808"

The following pages link to Combinatorial properties of boundary NLC graph languages (Q1089808):

Displaying 18 items.

• Nonterminal separation in graph grammars (Q804300) (← links)
• Boundary graph grammars with dynamic edge relabeling (Q909478) (← links)
• A comparison of boundary graph grammars and context-free hypergraph grammars (Q918718) (← links)
• Graph theoretic closure properties of the family of boundary NLC graph languages (Q1084870) (← 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)
• Logical description of context-free graph languages (Q1384534) (← links)
• Linear graph grammars: Power and complexity (Q1825679) (← 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)
• (Q3347320) (← links)
• Boundary NLC graph grammars—Basic definitions, normal forms, and complexity (Q3747744) (← links)
• The equivalence of boundary and confluent graph grammars on graph languages of bounded degree (Q5055770) (← links)