Pages that link to "Item:Q1363781"
From MaRDI portal
The following pages link to The bounded degree problem for eNCE graph grammars (Q1363781):
Displaying 7 items.
- The bounded degree problem for NLC grammars is decidable (Q579950) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages (Q1854438) (← links)
- Node replacements in embedding normal form. (Q1872709) (← links)
- Emptiness problems of eNCE graph languages (Q1908340) (← links)
- The bounded degree problem for non-obstructing eNCE graph grammars (Q4645278) (← links)
- The equivalence of boundary and confluent graph grammars on graph languages of bounded degree (Q5055770) (← links)