Pages that link to "Item:Q3782818"

The following pages link to Graph expressions and graph rewritings (Q3782818):

Displaying 50 items.

• Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
• Confluence for graph transformations (Q672753) (← links)
• Relational graph rewritings (Q673789) (← links)
• Monadic second-order evaluations on tree-decomposable graphs (Q685464) (← links)
• Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming (Q685465) (← links)
• An axiomatization of graphs (Q707454) (← links)
• Recursive queries and context-free graph grammars (Q753477) (← links)
• Note on node-rewriting graph grammars (Q796997) (← links)
• Modular tree transducers (Q807012) (← links)
• The monadic second-order logic of graphs. IV: Definability properties of equational graphs (Q807611) (← links)
• On expressiveness of the chain graph interpretations (Q895519) (← links)
• The generative power of delegation networks (Q897662) (← links)
• Undecidability of the bandwidth problem on linear graph languages (Q908714) (← links)
• A comparison of boundary graph grammars and context-free hypergraph grammars (Q918718) (← links)
• Second-order abstract categorial grammars as hyperedge replacement grammars (Q972434) (← links)
• Treewidth and logical definability of graph products (Q1006041) (← 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)
• The string generating power of context-free hypergraph grammars (Q1176107) (← links)
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232) (← links)
• Hypermap rewriting: A combinatorial approach (Q1178702) (← links)
• Algorithms for recognition of regular properties and decomposition of recursive graph families (Q1179734) (← links)
• Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families (Q1186787) (← links)
• Conditional rewriting logic as a unified model of concurrency (Q1190488) (← links)
• The monadic second-order logic of graphs. VII: Graphs as relational structures (Q1193407) (← links)
• Infinite hypergraphs. II: Systems of recursive equations (Q1199532) (← links)
• Context-free hypergraph grammars have the same term-generating power as attribute grammars (Q1199703) (← links)
• Trading independent for synchronized parallelism in finite copying parallel rewriting systems (Q1267708) (← links)
• The equivalence of bottom-up and top-down tree-to-graph transducers (Q1271618) (← links)
• A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
• Nondeterministic operations on finite relational structures (Q1276248) (← links)
• On hyperedge replacement and BNLC graph grammars (Q1308742) (← links)
• Separating \(k\)-separated eNCE graph languages (Q1314371) (← links)
• Hypergraph languages of bounded degree (Q1318469) (← links)
• Monadic second-order definable graph transductions: a survey (Q1325847) (← links)
• The complexity of connectivity problems on context-free graph languages (Q1333400) (← links)
• The monadic second order logic of graphs. VI: On several representations of graphs by relational structures (Q1336623) (← links)
• The translation power of top-down tree-to-graph transducers (Q1337465) (← links)
• Context-free graph languages of bounded degree are generated by apex graph grammars (Q1338891) (← links)
• Synthesized and inherited functions. A new computational model for syntax-directed semantics (Q1338894) (← links)
• Probabilistic hyperedge replacement grammars (Q1351216) (← links)
• The obstructions of a minor-closed set of graphs defined by a context-free grammar (Q1379821) (← links)
• Logical description of context-free graph languages (Q1384534) (← links)
• \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
• Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
• A comparison of compatible, finite, and inductive graph properties (Q1812942) (← links)
• Infinite hypergraphs. I: Basic properties (Q1814126) (← links)
• The monadic second-order logic of graphs. VIII: Orientations (Q1842126) (← links)
• The complexity of the \(K_{n,n}\)-problem for node replacement graph languages (Q1854438) (← links)
• Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)