The group-theoretic complexity of subsemigroups of Boolean matrices
type: Item
instance of: scholarly article
title: The group-theoretic complexity of subsemigroups of Boolean matrices
zbMATH Open document ID: 0402.20050
DOI: 10.1016/0024-3795(79)90024-7
published in: Linear Algebra and its Applications
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 20M15
Mathematics Subject Classification ID: 20M20
Mathematics Subject Classification ID: 15B33
zbMATH DE Number: 3623881
zbMATH Keywords: Group-Theoretic Complexity of Subsemigroups of Boolean Matrices
zbMATH Keywords: Green's Relation
author: Ki Hang Kim
author: Fred Roush
MaRDI profile type: Publication
full work available at URL: 0024-3795(79)90024-7
OpenAlex ID: W1987988942
cites work: A generalization of the Rees theorem to a class of regular semigroups
cites work: The semigroup of Hall relations
cites work: Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
cites work: Q5570933
cites work: Complexity of finite semigroups
cites work: Some results on finite semigroups
cites work: A homomorphism theorem for finite semigroups
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: Finite binary relations have no more complexity than finite functions
cites work: Lower bounds for complexity of finite semigroups
cites work: The Reliability of a Fault-Tolerant Configuration Having Variable Coverage
cites work: Decomposition and complexity of finite semigroups
cites work: Cascade synthesis of finite-state machines
description: scientific article; zbMATH DE number 3623881