scientific article; zbMATH DE number 431767
From MaRDI portal
Publication:3138543
zbMATH Open0789.18004MaRDI QIDQ3138543FDOQ3138543
Authors: Yves Lafont
Publication date: 11 November 1993
Title of this publication is not available (Why is that?)
Recommendations
symbolic computationword problemsPenrose diagramscomplete rewrite systemcategory of finite sets2-dimensional rewritingfinitely presentable 2-monoid
Cited In (13)
- Data Structures for Topologically Sound Higher-Dimensional Diagram Rewriting
- Optimal reductions in interaction systems
- Minimality of the system of seven equations for the category of finite sets
- Towards 3-dimensional rewriting theory
- Diagram Rewriting for Orthogonal Matrices: A Study of Critical Peaks
- Classes of finite relations as initial abstract data types. II
- Higher-dimensional word problems with applications to equational logic
- GS\(\cdot \Lambda \) theories: a syntax for higher-order graphs
- Towards an algebraic theory of Boolean circuits.
- Computing critical pairs in 2-dimensional rewriting systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Termination orders for three-dimensional rewriting
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138543)