The group-theoretic complexity of subsemigroups of Boolean matrices

DOI10.1016/0024-3795(79)90024-7MaRDI QIDQ1255585zbMATH OpenOpenAlexFDO

Authors Ki Hang Kim, Fred 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

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

Cites work

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

Cited in

(1)

• The publications of Ki Hang Kim

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1255585)