Category:Semigroup theory
 | Computing portal |
Here is a list of articles in the category Semigroup theory of the Computing portal that unifies foundations of mathematics and computations using computers.
 |
Wikimedia Commons has media related to Semigroup theory. |
This category includes topics on semigroups, and also on monoids, a special case in which the semigroup has an identity element.
Pages in category "Semigroup theory"
The following 96 pages are in this category, out of 96 total.
-
- *-regular semigroup (computing)
3
- 3x + 1 semigroup (computing)
A
- Absorbing element (computing)
- Analytic semigroup (computing)
- Aperiodic semigroup (computing)
- Arf semigroup (computing)
- Automatic semigroup (computing)
B
- Baer *-semigroup (computing)
- Band (algebra) (computing)
- Band (mathematics) (computing)
- Bicyclic semigroup (computing)
- Biordered set (computing)
- Brandt semigroup (computing)
C
- C0-semigroup (computing)
- Cancellative semigroup (computing)
- Catholic semigroup (computing)
- Chinese monoid (computing)
- Clifford semigroup (computing)
- Compact semigroup (computing)
- Completely regular semigroup (computing)
D
- Dyck congruence (computing)
E
- E-dense semigroup (computing)
- E-semigroup (computing)
- Empty semigroup (computing)
- Epigroup (computing)
F
- Foulis semigroup (computing)
- Four-spiral semigroup (computing)
- Free half group (computing)
- Free monoid (computing)
- Full linear monoid (computing)
G
- Garside element (computing)
- Green's relations (computing)
H
- Hille–Yosida theorem (computing)
- History monoid (computing)
I
- I-semigroup (computing)
- Invariant convex cone (computing)
- Inverse semigroup (computing)
- Involutive monoid (computing)
- IP set (computing)
K
- Krohn–Rhodes theory (computing)
L
- Light's associativity test (computing)
- Local language (formal language) (computing)
- Lumer–Phillips theorem (computing)
M
- Matrix unit (computing)
- Monogenic semigroup (computing)
- Monoid (computing)
- Morphic word (computing)
- Munn semigroup (computing)
N
- Nambooripad order (computing)
- Nilsemigroup (computing)
- Nowhere commutative semigroup (computing)
- Null semigroup (computing)
- Numerical semigroup (computing)
O
- Ordered semigroup (computing)
- Orthodox semigroup (computing)
P
- Partial isometry (computing)
- Piecewise syndetic set (computing)
- Plactic monoid (computing)
- Presentation of a monoid (computing)
- Principal factor (computing)
Q
- Quasicontraction semigroup (computing)
R
- Rational monoid (computing)
- Recurrent word (computing)
- Rees factor semigroup (computing)
- Rees matrix semigroup (computing)
- Refinement monoid (computing)
- Regular semigroup (computing)
S
- Schutzenberger group (computing)
- Semiautomaton (computing)
- Semigroup (computing)
- Semigroup action (computing)
- Semigroup Forum (organization)
- Semigroup with involution (computing)
- Semigroup with three elements (computing)
- Semigroup with two elements (computing)
- Sesquipower (computing)
- Shamir congruence (computing)
- Skew lattice (computing)
- Special classes of semigroups (computing)
- Splicing rule (computing)
- Strongly measurable functions (computing)
- Symmetric inverse semigroup (computing)
- Syndetic set (computing)
- Syntactic monoid (computing)
T
- Thick set (computing)
- Trace monoid (computing)
- Transformation semigroup (computing)
- Trivial semigroup (computing)
U
- U-semigroup (computing)
- Unavoidable pattern (computing)
V
- Variety of finite semigroups (computing)
W
- Wagner congruence (computing)
- Weak inverse (computing)
- Weight (strings) (computing)
- Word problem for semigroups (computing)
Z
- Zerosumfree monoid (computing)
Mathematics
Organizations
Books
About