Pages that link to "Item:Q579950"

The following pages link to The bounded degree problem for NLC grammars is decidable (Q579950):

Displaying 12 items.

• Graph theoretic closure properties of the family of boundary NLC graph languages (Q1084870) (← links)
• Metatheorems for decision problems on hyperedge replacement graph languages (Q1121675) (← 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)
• The bounded degree problem for eNCE graph grammars (Q1363781) (← links)
• The complexity of the \(K_{n,n}\)-problem for node replacement graph languages (Q1854438) (← links)
• Lambek Grammars with One Division Are Decidable in Polynomial Time (Q3503645) (← links)
• The bounded degree problem for non-obstructing eNCE graph grammars (Q4645278) (← links)
• Graph automata for linear graph languages (Q4645286) (← links)
• The equivalence of boundary and confluent graph grammars on graph languages of bounded degree (Q5055770) (← links)
• Decision problems for edge grammars (Q5096886) (← links)