The following pages link to Neighborhood-uniform NLC grammars (Q3026361):
Displaying 5 items.
- On the structure of linear apex NLC graph grammars (Q441855) (← links)
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars (Q1102759) (← links)
- Separating \(k\)-separated eNCE graph languages (Q1314371) (← links)
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting (Q1960412) (← links)
- Decision problems for edge grammars (Q5096886) (← links)
