Pages that link to "Item:Q3782818"
From MaRDI portal
The following pages link to Graph expressions and graph rewritings (Q3782818):
Displaying 50 items.
- Independent parallelism in finite copying parallel rewriting systems (Q1960409) (← links)
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting (Q1960412) (← links)
- Bottom-up unranked tree-to-graph transducers for translation into semantic graphs (Q2029483) (← links)
- Weighted parsing for grammar-based language models over multioperator monoids (Q2051800) (← links)
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids (Q2136289) (← links)
- The complexity of graph languages generated by hyperedge replacement (Q2277851) (← links)
- Handle-rewriting hypergraph grammars (Q2366278) (← links)
- Constraint relaxation may be perfect (Q2384384) (← links)
- Drags: a compositional algebraic framework for graph rewriting (Q2422028) (← links)
- Graph transformation for incremental natural language analysis (Q2441777) (← links)
- Recognizability of graph and pattern languages (Q2491214) (← links)
- A general framework for types in graph rewriting (Q2581012) (← links)
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs (Q2641288) (← links)
- Uniform parsing for hyperedge replacement grammars (Q2656168) (← links)
- Unification of drags and confluence of drag rewriting (Q2683036) (← links)
- Causality in Bounded Petri Nets is MSO Definable (Q2820695) (← links)
- Reachability in Graph Transformation Systems and Slice Languages (Q2947215) (← links)
- Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models (Q2957506) (← links)
- Selected Decision Problems for Square-Refinement Collage Grammars (Q3098030) (← links)
- Graph decompositions for cartesian products (Q3439368) (← links)
- The monadic second-order logic of graphs, II: Infinite graphs of bounded width (Q3470112) (← links)
- From Tree-Based Generators to Delegation Networks (Q3522858) (← links)
- A representation of graphs by algebraic expressions and its use for graph rewriting systems (Q3785986) (← links)
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues (Q4012672) (← links)
- Recognizable sets of graphs: equivalent definitions and closure properties (Q4286529) (← links)
- Graph decompositions and tree automata in reasoning with uncertainty (Q4286533) (← links)
- Automata-based Representations for Infinite Graphs (Q4331049) (← links)
- Recognizable languages of arrows and cospans (Q4585008) (← links)
- (Q4621159) (← links)
- The contractum in algebraic graph rewriting (Q4645265) (← links)
- A category-theoretical approach to vertex replacement: The generation of infinite graphs (Q4645266) (← links)
- Graph unification and matching (Q4645268) (← links)
- The use of tree transducers to compute translations between graph algebras (Q4645277) (← links)
- Process specification and verification (Q4645279) (← links)
- The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed (Q4645287) (← links)
- Concatenation of graphs (Q4645288) (← links)
- HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting (Q4645289) (← links)
- A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths (Q4645295) (← links)
- Some applications of logic, of universal algebra, and of category theory to the theory of graph transformations (Q4729378) (← links)
- (Q4852905) (← links)
- Algebraic structures of directed acyclic graphs: application to concurrent calculus (Q4876370) (← links)
- The monoidal structure of Turing machines (Q4917187) (← links)
- Hyperedge replacement with rendezvous (Q5044734) (← links)
- Extending graph rewriting with copying (Q5096274) (← links)
- Graph-grammar semantics of a higher-order programming language for distributed systems (Q5096275) (← links)
- Graphs and designing (Q5096282) (← links)
- Set-theoretic graph rewriting (Q5096290) (← links)
- On relating rewriting systems and graph grammars to event structures (Q5096291) (← links)
- An introduction to category-based equational logic (Q5096381) (← links)
- \(K_4\)-free graphs as a free algebra (Q5111293) (← links)
