HomePage | RecentChanges | Preferences
Difference (from revision 2 to current revision)
(minor diff, author diff)
Removed: 1d0
Changed: 4c3
Changed: 34c33
Changed: 38c37
|
| Decidable in polynomial time |
|
| decidable in polynomial time |
Changed: 42c41
Changed: 46c45
Changed: 50c49
Changed: 54c53
Changed: 58c57
Changed: 62c61
Changed: 66c65
Changed: 70c69
Changed: 74c73
Changed: 86c85
Changed: 90c89
Changed: 94c93
Changed: 98c97
Added: 101a101,102
Changed: 108c109,110
Added: 113a116
Abbreviation: Sgrp
Definition
A semigroup is a structure S = (S,·), where · is an infix binary operation, called the
semigroup product, such that
· is associative: (xy)z = x(yz).
Morphisms
Let S and T be semigroups. A morphism from S
to T is a function h : S→T that is a homomorphism:
h(xy) = h(x)h(y).
Some results
Examples
(XX,o), the collection of functions on a
sets X, with composition.
(Σ + ,·), the collection of nonempty
strings over Σ, with concatenation.
Properties
Finite members
Search for finite semigroups
Size 1: 1
Size 2: 5
Size 3: 24
Size 4: 188
[Size 5]?: 1915
[Size 6]?: 28634
[Size 7]?: 1627672
[Semigroups in the Encyclopedia of Integer Sequences]
Subclasses
Bands
Commutative semigroups
Monoids
Semigroups with zero
Superclasses
Groupoids
[Partial semigroups]?