On ``On graph rewritings

DOI10.1016/0304-3975(87)90079-XzbMath0636.68028OpenAlexW2130238476MaRDI QIDQ1098284

Richard Kennaway

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90079-x

zbMATH Keywords

NP-complete problemsgraph rewritingrewrite as pushout in a category of graphs

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Categories of machines, automata (18B20)

Related Items (26)

Term graph rewriting and garbage collection using opfibrations ⋮ Term rewriting in CTΣ ⋮ Redex capturing in term graph rewriting (concise version) ⋮ Lambda calculus with explicit recursion ⋮ Relating graph and term rewriting via Böhm models ⋮ Parallelism in single-pushout graph rewriting ⋮ Set-theoretic graph rewriting ⋮ A decade of TAPSOFT ⋮ Multilevel graph grammars ⋮ Term-Graph Rewriting Via Explicit Paths ⋮ Properties of graphs preserved by relational graph rewritings ⋮ Strategic port graph rewriting: an interactive modelling framework ⋮ Confluence for graph transformations ⋮ Relational graph rewritings ⋮ Conditional rewriting logic as a unified model of concurrency ⋮ Algebraic approach to single-pushout graph transformation ⋮ Parallel and distributed derivations in the single-pushout approach ⋮ Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming ⋮ Categorical principles, techniques and results for high-level-replacement systems in computer science ⋮ Categorical rewriting of term-like structures ⋮ Rewriting on cyclic structures: Equivalence between the operational and the categorical description ⋮ A categorical manifesto ⋮ A Heterogeneous Pushout Approach to Term-Graph Transformation ⋮ Unnamed Item ⋮ Generating irregular partitionable data structures ⋮ Term-graph Rewriting in Tom Using Relative Positions

Uses Software

• DACTL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On graph rewritings
• Computation on graph-like expressions
• Optimal evaluations of graph-like expressions
• Speeding up subtree replacement systems
• LEAN: An intermediate language based on graph rewriting

This page was built for publication: On ``On graph rewritings