Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines

  • Krohn K
  • Rhodes J
N/ACitations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

Introduction. In the following all semigroups are of finite order. One semigroup Si is said to divide another semigroup S2, written Si| S2, if Si is a homomorphic image of a subsemigroup of S2. The semidirect product of S2 by Si, with connecting homomorphism Y, is written S2 Xy Si. See Definition 1.6. A semigroup S is called irreducible if for all finite semigroups S2 and Si and all connecting homomorphisms Y, S\textbackslash(S2Xy Si) implies S| S2 or S| Si. It is shown that S is irreducible if and only if either:(i) S is a nontrivial simple group, in …

Cite

CITATION STYLE

APA

Krohn, K., & Rhodes, J. (1965). Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines. Transactions of the American Mathematical Society, 116, 450. https://doi.org/10.2307/1994127

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free