Classes of finite relations as initial abstract data types. II

DOI10.1016/0012-365X(94)90252-6zbMath0798.08007MaRDI QIDQ1318793

Gheorghe Ştefănescu, Virgil Emil Căzănescu

Publication date: 4 April 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

algebraic theorymatrix theorymultirelationsinitial algebrastrict monoidal categories

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Abstract data types; algebraic specification (68Q65) Equational logic, Mal'tsev conditions (08B05)

Related Items (1)

A Term-Graph Syntax for Algebras over Multisets

Cites Work

• On flowchart theories. II: The nondeterministic case
• Classes of finite relations as initial abstract data types. I
• Matricial theories
• Automata in general algebras
• Unnamed Item

This page was built for publication: Classes of finite relations as initial abstract data types. II