scientific article; zbMATH DE number 431767

MaRDI QIDQ3138543zbMATH OpenFDO

Authors Yves Lafont

Publication date 11 November 1993

zbMATH Keywords

symbolic computationword problemsPenrose diagramscomplete rewrite systemcategory of finite sets2-dimensional rewritingfinitely presentable 2-monoid

Mathematics Subject Classification ID

Categories of sets, characterizations (18B05) Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 130889
• Computing critical pairs in 2-dimensional rewriting systems
• scientific article; zbMATH DE number 517043
• Algebra and geometry of rewriting
• Towards 3-dimensional rewriting theory

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
• scientific article; zbMATH DE number 130889 (Why is no real title available?)
• scientific article; zbMATH DE number 517043 (Why is no real title available?)
• 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)