The following pages link to (Q3316615):
Displaying 11 items.
- Results of NLC grammars with one-letter terminal alphabets (Q909481) (← links)
- Handle NLC grammars and r. e. languages (Q1092670) (← links)
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars (Q1102759) (← links)
- Power properties of NLC graph grammars with a polynomial membership problem (Q1129012) (← links)
- Monadic second-order definable graph transductions: a survey (Q1325847) (← links)
- Graph grammars according to the type of input and manipulated data: a survey (Q1750316) (← links)
- Handle-rewriting hypergraph grammars (Q2366278) (← links)
- On the inference of non-confluent NLC graph grammars (Q2843997) (← links)
- (Q3347320) (← links)
- Narrowing grammar: theory, implementation, and applications (Q4015959) (← links)
- (Q4852905) (← links)