Pages that link to "Item:Q684560"

The following pages link to Hyperedge replacement: grammars and languages (Q684560):

Displaying 50 items.

• Bottom-up unranked tree-to-graph transducers for translation into semantic graphs (Q2029483) (← links)
• Powerful and NP-complete: hypergraph Lambek grammars (Q2117261) (← links)
• Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars (Q2117263) (← links)
• Deciding non-emptiness of hypergraph languages generated by connection-preserving fusion grammars is NP-complete (Q2232268) (← links)
• Language theoretic properties of regular DAG languages (Q2272978) (← links)
• The complexity of graph languages generated by hyperedge replacement (Q2277851) (← links)
• Handle-rewriting hypergraph grammars (Q2366278) (← links)
• Specifying graph languages with type graphs (Q2423749) (← links)
• Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement (Q2423756) (← links)
• Fixpoint logics over hierarchical structures (Q2429724) (← links)
• Graph transformation for incremental natural language analysis (Q2441777) (← links)
• A general framework for types in graph rewriting (Q2581012) (← links)
• Uniform parsing for hyperedge replacement grammars (Q2656168) (← links)
• Theoretical properties in hypergraphs (Q2914544) (← links)
• A Local Greibach Normal Form for Hyperedge Replacement Grammars (Q3004590) (← links)
• (Q3070891) (← links)
• Selected Decision Problems for Square-Refinement Collage Grammars (Q3098030) (← links)
• Automatic Deduction of Induced Subgraphs of Some Infinite Families of Graphs (Q3439509) (← links)
• Graph-Based Design and Analysis of Dynamic Software Architectures (Q3507356) (← links)
• (Q4037322) (← links)
• A category-theoretical approach to vertex replacement: The generation of infinite graphs (Q4645266) (← links)
• Graph unification and matching (Q4645268) (← links)
• On the interleaving semantics of transformation units — A step into GRACE (Q4645269) (← links)
• Using attributed flow graph parsing to recognize clichés in programs (Q4645274) (← links)
• The bounded degree problem for non-obstructing eNCE graph grammars (Q4645278) (← links)
• Concatenation of graphs (Q4645288) (← links)
• Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence (Q4645290) (← links)
• Transformations of graph grammars (Q4645292) (← links)
• (Q4852905) (← links)
• Context-free hypergraph grammars with node rewriting (Q4923541) (← links)
• (Q5020538) (← links)
• (Q5021223) (← links)
• (Q5021232) (← links)
• Criteria to disprove context-freeness of collage languages (Q5055932) (← links)
• Preserving consistency in geometric modeling with graph transformations (Q5059141) (← links)
• (Q5090956) (← links)
• Single pushout transformations of equationally defined graph structures with applications to actor systems (Q5096285) (← links)
• Decision problems for edge grammars (Q5096886) (← links)
• Graph Parsing as Graph Transformation (Q5100735) (← links)
• Hierarchical Design Rewriting with Maude (Q5179129) (← links)
• A Greibach normal form for context-free graph grammars (Q5204313) (← links)
• Two strikes against perfect phylogeny (Q5204323) (← links)
• On spectra of sentences of monadic second order logic with counting (Q5311744) (← links)
• Towards a Systematic Method for Proving Termination of Graph Transformation Systems (Q5403457) (← links)
• Node rewriting in graphs and hypergraphs: A categorical framework (Q5958766) (← links)
• Concurrent graph and term graph rewriting (Q6162098) (← links)
• Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power (Q6487303) (← links)
• Closure properties of context-free hyperedge replacement systems (Q6550538) (← links)
• On the power of local graph expansion grammars with and without additional restrictions (Q6614008) (← links)
• Grammars based on a logic of hypergraph languages (Q6649532) (← links)