Locating the contractum in the double pushout approach

DOI10.1016/0304-3975(94)00301-4MaRDI QIDQ672236zbMATH OpenOpenAlexFDO

Authors Richard Banach

Publication date 27 February 1997

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

Full work available at URL https://doi.org/10.1016/0304-3975(94)00301-4

zbMATH Keywords

algebraic graph rewritingdouble pushout graph rewritingterm graph rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• The contractum in algebraic graph rewriting
• scientific article; zbMATH DE number 1638662
• scientific article; zbMATH DE number 177420
• scientific article; zbMATH DE number 139800
• scientific article; zbMATH DE number 177452

Cites work

• scientific article; zbMATH DE number 4160147 (Why is no real title available?)
• scientific article; zbMATH DE number 4164141 (Why is no real title available?)
• scientific article; zbMATH DE number 4049095 (Why is no real title available?)
• scientific article; zbMATH DE number 46995 (Why is no real title available?)
• scientific article; zbMATH DE number 177439 (Why is no real title available?)
• scientific article; zbMATH DE number 177452 (Why is no real title available?)
• scientific article; zbMATH DE number 3633737 (Why is no real title available?)
• scientific article; zbMATH DE number 234035 (Why is no real title available?)
• Canonical derivations for high-level replacement systems
• LEAN: An intermediate language based on graph rewriting
• Parallelism and concurrency in high-level replacement systems
• Pushout-Properties: An analysis of gluing constructions for graphs
• Term graph rewriting and garbage collection using opfibrations

Cited in

(2)

• The contractum in algebraic graph rewriting
• Regular relations and bicartesian squares

This page was built for publication: Locating the contractum in the double pushout approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672236)