The group-theoretic complexity of subsemigroups of Boolean matrices

DOI10.1016/0024-3795(79)90024-7zbMath0402.20050OpenAlexW1987988942MaRDI QIDQ1255585

Kim Hang Kim, Fred W. Roush

Publication date: 1979

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(79)90024-7

zbMATH Keywords

Green's RelationGroup-Theoretic Complexity of Subsemigroups of Boolean Matrices

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Mappings of semigroups (20M15)

Related Items (1)

The publications of Ki Hang Kim

Cites Work

• Unnamed Item
• The semigroup of Hall relations
• Finite binary relations have no more complexity than finite functions
• Complexity of finite semigroups
• Some results on finite semigroups
• Decomposition and complexity of finite semigroups
• A generalization of the Rees theorem to a class of regular semigroups
• Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups
• Lower bounds for complexity of finite semigroups
• The Reliability of a Fault-Tolerant Configuration Having Variable Coverage
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Cascade synthesis of finite-state machines
• The fundamental lemma of complexity for arbitrary finite semigroups
• A homomorphism theorem for finite semigroups

This page was built for publication: The group-theoretic complexity of subsemigroups of Boolean matrices