Partial pullback complement rewriting

DOI10.1016/j.tcs.2015.04.006zbMath1328.68104OpenAlexW1964126955MaRDI QIDQ2355683

S. N. Hosseini, A. R. Shir Ali Nasab

Publication date: 24 July 2015

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.04.006

zbMATH Keywords

exponentialgraph transformation(partial) pullback complement(pullback, double-pullback, single-pushout, double-pushout, sesqui-pushout, span, partial pullback complement) rewritinguniversal mono

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30)

Related Items

Pullback in partial morphism categories ⋮ Unnamed Item ⋮ Partial pullback complement rewriting along admissible matches

Cites Work

• Unnamed Item
• Unnamed Item
• Algebraic approach to single-pushout graph transformation
• Universal monos in partial morphism categories
• Exponentiable morphisms, partial products and pullback complements
• Sheaves in geometry and logic: a first introduction to topos theory
• Pullback in partial morphism categories
• Adhesivity with Partial Maps instead of Spans
• Sesqui-Pushout Rewriting
• Toposes Are Adhesive
• Graph Rewriting in Span-Categories
• Adhesive and quasiadhesive categories
• Double-pullback transitions and coalgebraic loose semantics for graph transformation systems