Finite binary relations have no more complexity than finite functions
From MaRDI portal
Cites work
- A generalization of the Rees theorem to a class of regular semigroups
- A proof of the Montague-Plemmons-Schein theorem on maximal subgroups of the semigroup of binary relations
- Decomposition and complexity of finite semigroups
- Groups of binary relations
- Homomorphisms of semigroups of binary relations
- scientific article; zbMATH DE number 3137414 (Why is no real title available?)
- Idempotents and product representations with applications to the semigroup of binary relations
- Lower bounds for complexity of finite semigroups
- Maximal subgroups of the semigroup of relations
- On the semigroup of binary relations
- Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups
- Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups
- Some results on finite semigroups
- The fundamental lemma of complexity for arbitrary finite semigroups
- The Schützenberger group of an H-class in the semigroup of binary relations
Cited in
(5)
This page was built for publication: Finite binary relations have no more complexity than finite functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1212557)