Pages that link to "Item:Q4037313"

The following pages link to Context-free handle-rewriting hypergraph grammars (Q4037313):

Displaying 28 items.

• Tree-depth and vertex-minors (Q281932) (← links)
• Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
• Polynomial graph invariants from homomorphism numbers (Q906477) (← links)
• On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth (Q987381) (← links)
• The NLC-width and clique-width for powers of graphs of bounded tree-width (Q1028448) (← links)
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars (Q1102759) (← links)
• The string generating power of context-free hypergraph grammars (Q1176107) (← links)
• The monadic second-order logic of graphs. VII: Graphs as relational structures (Q1193407) (← links)
• Context-free hypergraph grammars have the same term-generating power as attribute grammars (Q1199703) (← links)
• Hypergraph languages of bounded degree (Q1318469) (← links)
• The monadic second order logic of graphs. VI: On several representations of graphs by relational structures (Q1336623) (← links)
• Generating irregular partitionable data structures (Q1575237) (← links)
• The generative power of context-free node rewriting in hypergraphs (Q1592924) (← links)
• HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting (Q1960412) (← links)
• Hypergraph Lambek grammars (Q2079680) (← links)
• Pursuing a fast robber on a graph (Q2268876) (← links)
• Handle-rewriting hypergraph grammars (Q2366278) (← links)
• A SAT Approach to Clique-Width (Q2946763) (← links)
• (Q3070891) (← links)
• Normal forms for context-free node-rewriting hypergraph grammars (Q3146248) (← links)
• Synthesis for Structure Rewriting Systems (Q3182943) (← links)
• On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract) (Q3503637) (← links)
• (Q4033498) (← links)
• (Q4037317) (← links)
• (Q4625695) (← links)
• Context-free hypergraph grammars with node rewriting (Q4923541) (← links)
• Clique-width of point configurations (Q5918571) (← links)
• Succinct data structures for bounded clique-width graphs (Q6497944) (← links)