Ranks of binary relations

DOI10.1007/BF02676619zbMath0873.20044OpenAlexW2137637829MaRDI QIDQ1357114

V. Froidure

Publication date: 2 November 1997

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

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

zbMATH Keywords

relationsBoolean matricessemigroups of relationstransitive unambiguous monoidsunambiguous decompositionsunambiguous productsunambiguous rankunambiguous sums

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Other classical set theory (including functions, relations, and set algebra) (03E20)

Related Items (1)

Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On unambiguous reductions of monoids of unambiguous relations
• The boxes
• On synchronizing unambiguous automata
• Une représentation fidele des groupes d'un monoide de rélations binaires sur un ensemble fini
• On cardinalities of row spaces of Boolean matrices
• On the semigroup of binary relations

This page was built for publication: Ranks of binary relations