The following pages link to (Q3974863):
Displayed 20 items.
- Order independent NCE grammars recognized in polynomial time (Q1182091) (← links)
- Nondeterministic operations on finite relational structures (Q1276248) (← links)
- The generating power of total deterministic tree transducers (Q1281500) (← links)
- Hypergraph languages of bounded degree (Q1318469) (← links)
- Monadic second-order definable graph transductions: a survey (Q1325847) (← links)
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures (Q1336623) (← links)
- Context-free graph languages of bounded degree are generated by apex graph grammars (Q1338891) (← links)
- Logical description of context-free graph languages (Q1384534) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars (Q1582010) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages (Q1854438) (← links)
- Handle-rewriting hypergraph grammars (Q2366278) (← links)
- Graph automata for linear graph languages (Q4645286) (← links)
- (Q4852905) (← links)
- GETGRATS (Q4923529) (← links)
- Context-free hypergraph grammars with node rewriting (Q4923541) (← links)
- The equivalence of boundary and confluent graph grammars on graph languages of bounded degree (Q5055770) (← links)
- A Greibach normal form for context-free graph grammars (Q5204313) (← links)
- Maximum flows in parametric graph templates (Q6057318) (← links)