Pages that link to "Item:Q1155373"
From MaRDI portal
The following pages link to Decision problems for node label controlled graph grammars (Q1155373):
Displaying 17 items.
- The bounded degree problem for NLC grammars is decidable (Q579950) (← links)
- Note on node-rewriting graph grammars (Q796997) (← links)
- Results of NLC grammars with one-letter terminal alphabets (Q909481) (← links)
- Edge-label controlled graph grammars (Q909484) (← links)
- Restrictions on NLC graph grammars (Q1059402) (← 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)
- Characteristics of graph languages generated by edge replacement (Q1098320) (← links)
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars (Q1102759) (← links)
- Hypermap rewriting: A combinatorial approach (Q1178702) (← links)
- Separating \(k\)-separated eNCE graph languages (Q1314371) (← links)
- Graph grammars according to the type of input and manipulated data: a survey (Q1750316) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- Linear graph grammars: Power and complexity (Q1825679) (← links)
- Node replacements in embedding normal form. (Q1872709) (← links)
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting (Q1960412) (← links)
