Computing finite commutative semigroups

DOI10.1007/BF02574129zbMath0864.20034OpenAlexW2073131509MaRDI QIDQ1924511

Pierre Antoine Grillet

Publication date: 18 June 1997

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/135478

zbMATH Keywords

algorithmsbinary operationscommutative semigroups of order 9finite totally ordered setsweak precedence

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (2)

The semigroups of order 9 and their automorphism groups. ⋮ Ordered semigroups of size at most 7 and linearly ordered semigroups of size at most 10.

Cites Work

• Die Halbgruppen der Ordnungen \(\leq 7\)
• Semigroups of order \(8\)
• SWAC Computes 126 Distinct Semigroups of Order 4
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing finite commutative semigroups