The following pages link to (Q3789084):
Displaying 13 items.
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- Recognising \(k\)-connected hypergraphs in cubic time (Q685463) (← links)
- Metatheorems for decision problems on hyperedge replacement graph languages (Q1121675) (← links)
- The string generating power of context-free hypergraph grammars (Q1176107) (← links)
- Context-free hypergraph grammars have the same term-generating power as attribute grammars (Q1199703) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- On hyperedge replacement and BNLC graph grammars (Q1308742) (← links)
- The translation power of top-down tree-to-graph transducers (Q1337465) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- The complexity of graph languages generated by hyperedge replacement (Q2277851) (← links)
- (Q4852905) (← links)
- A Greibach normal form for context-free graph grammars (Q5204313) (← links)
