Pages that link to "Item:Q1154289"
From MaRDI portal
The following pages link to A characterization of context-free string languages by directed node- label controlled graph grammars (Q1154289):
Displaying 14 items.
- The bounded degree problem for NLC grammars is decidable (Q579950) (← links)
- On structured graph grammars. I (Q753498) (← links)
- The complexity of regular DNLC graph languages (Q909473) (← links)
- Boundary graph grammars with dynamic edge relabeling (Q909478) (← links)
- Results of NLC grammars with one-letter terminal alphabets (Q909481) (← links)
- Restrictions on NLC graph grammars (Q1059402) (← links)
- Traces, dependency graphs and DNLC grammars (Q1081307) (← links)
- On the membership problem for regular DNLC grammars (Q1082088) (← links)
- Handle NLC grammars and r. e. languages (Q1092670) (← links)
- Theory of traces (Q1107296) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- Graph grammars according to the type of input and manipulated data: a survey (Q1750316) (← links)
- Linear graph grammars: Power and complexity (Q1825679) (← links)
- On structured graph grammars. II (Q2277857) (← links)
