The following pages link to Dirk Janssens (Q579949):
Displaying 17 items.
- The bounded degree problem for NLC grammars is decidable (Q579950) (← links)
- Adaptive star grammars and their languages (Q986544) (← links)
- (Q1148686) (redirect page) (← links)
- On the structure of node-label-controlled graph languages (Q1148687) (← links)
- Restrictions, extensions, and variations of NLC grammars (Q1148688) (← links)
- A characterization of context-free string languages by directed node- label controlled graph grammars (Q1154289) (← links)
- Decision problems for node label controlled graph grammars (Q1155373) (← links)
- Almost contact structures and curvature tensors (Q1157792) (← links)
- Graph grammars with neighbourhood-controlled embedding (Q1165019) (← links)
- Computation graphs for actor grammars (Q1208925) (← links)
- A Calculus for Team Automata (Q2873606) (← links)
- Neighborhood-uniform NLC grammars (Q3026361) (← links)
- On sequential and parallel node-rewriting graph grammars (Q3313279) (← links)
- (Q3316615) (← links)
- (Q3316616) (← links)
- (Q3325062) (← links)
- (Q3347311) (← links)
