The following pages link to On ``On graph rewritings'' (Q1098284):
Displaying 25 items.
- Confluence for graph transformations (Q672753) (← links)
- Relational graph rewritings (Q673789) (← links)
- Algebraic approach to single-pushout graph transformation (Q685460) (← links)
- Parallel and distributed derivations in the single-pushout approach (Q685462) (← links)
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming (Q685465) (← links)
- Categorical principles, techniques and results for high-level-replacement systems in computer science (Q690375) (← links)
- Conditional rewriting logic as a unified model of concurrency (Q1190488) (← links)
- Term graph rewriting and garbage collection using opfibrations (Q1331928) (← links)
- Lambda calculus with explicit recursion (Q1383145) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- Relating graph and term rewriting via Böhm models (Q1924551) (← links)
- Properties of graphs preserved by relational graph rewritings (Q1961871) (← links)
- Term-graph Rewriting in Tom Using Relative Positions (Q2870309) (← links)
- Term-Graph Rewriting Via Explicit Paths (Q3522007) (← links)
- A Heterogeneous Pushout Approach to Term-Graph Transformation (Q3636827) (← links)
- (Q4032925) (← links)
- Strategic port graph rewriting: an interactive modelling framework (Q4629264) (← links)
- A categorical manifesto (Q4713397) (← links)
- Categorical rewriting of term-like structures (Q4923533) (← links)
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description (Q4943554) (← links)
- Term rewriting in CTΣ (Q5044755) (← links)
- Redex capturing in term graph rewriting (concise version) (Q5055745) (← links)
- Parallelism in single-pushout graph rewriting (Q5096286) (← links)
- Set-theoretic graph rewriting (Q5096290) (← links)
- A decade of TAPSOFT (Q5096723) (← links)
