Finite binary relations have no more complexity than finite functions
type: Item
instance of: scholarly article
title: Finite binary relations have no more complexity than finite functions
zbMATH Open document ID: 0294.20057
DOI: 10.1007/BF02315969
author: S. Singh
published in: Semigroup Forum
publication date: 1974-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/134004
Mathematics Subject Classification ID: 20M10
zbMATH DE Number: 3460556
MaRDI profile type: Publication
cites work: A generalization of the Rees theorem to a class of regular semigroups
cites work: The Schützenberger group of an H-class in the semigroup of binary relations
cites work: A proof of the Montague-Plemmons-Schein theorem on maximal subgroups of the semigroup of binary relations
cites work: Q3253839
cites work: Idempotents and product representations with applications to the semigroup of binary relations
cites work: Homomorphisms of semigroups of binary relations
cites work: Maximal subgroups of the semigroup of relations
cites work: Groups of binary relations
cites work: On the semigroup of binary relations
cites work: The fundamental lemma of complexity for arbitrary finite semigroups
cites work: Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups
cites work: Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups
cites work: Some results on finite semigroups
cites work: Lower bounds for complexity of finite semigroups
cites work: Decomposition and complexity of finite semigroups
OpenAlex ID: W2022613966
description: scientific article; zbMATH DE number 3460556