scientific article; zbMATH DE number 177438

MaRDI QIDQ4037313zbMATH OpenFDO

Authors Joost Engelfriet, Grzegorz Rozenberg, Bruno Courcelle

Publication date 18 May 1993

zbMATH Keywords

hypergraphgraph grammarsrecursive systems of equations

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Hypergraphs (05C65) Grammars and rewriting systems (68Q42)

Recommendations

• Handle-rewriting hypergraph grammars
• Hypergraph languages of bounded degree
• The generative power of context-free node rewriting in hypergraphs
• HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
• Context-free hypergraph grammars with node rewriting

Cited in

(32)

• The monadic second-order logic of graphs. VII: Graphs as relational structures
• HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
• Pursuing a fast robber on a graph
• Satisfiability of acyclic and almost acyclic CNF formulas
• The string generating power of context-free hypergraph grammars
• Tree-depth and vertex-minors
• On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth
• Context-free grammars with linked nonterminals
• Contextual Hypergraph Grammars – A New Approach to the Generation of Hypergraph Languages
• scientific article; zbMATH DE number 4041304 (Why is no real title available?)
• scientific article; zbMATH DE number 177442 (Why is no real title available?)
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Hypergraph languages of bounded degree
• Handle-rewriting hypergraph grammars
• The NLC-width and clique-width for powers of graphs of bounded tree-width
• scientific article; zbMATH DE number 1116593 (Why is no real title available?)
• scientific article; zbMATH DE number 165817 (Why is no real title available?)
• Context-free hypergraph grammars have the same term-generating power as attribute grammars
• Clique-width of point configurations
• Context-free hypergraph grammars with node rewriting
• Polynomial graph invariants from homomorphism numbers
• The generative power of context-free node rewriting in hypergraphs
• The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
• Succinct data structures for bounded clique-width graphs
• Normal forms for context-free node-rewriting hypergraph grammars
• Hypergraph Lambek grammars
• Context-Free Categorical Grammars
• On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract)
• Generating irregular partitionable data structures
• scientific article; zbMATH DE number 7029306 (Why is no real title available?)
• scientific article; zbMATH DE number 5842462 (Why is no real title available?)
• Synthesis for Structure Rewriting Systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037313)