subsemigroup
Look at other dictionaries:
Semigroup — This article is about the algebraic structure. For applications to differential equations, see C0 semigroup. In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative binary operation. A semigroup… … Wikipedia
Special classes of semigroups — In mathematics, a semigroup is a nonempty set together with an associative binary operation. A special class of semigroups is a class of semigroups satisfying additional properties or conditions. Thus the class of commutative semigroups consists… … Wikipedia
Krohn–Rhodes theory — In mathematics and computer science, Krohn Rhodes theory is an approach to the study of finite semigroups and automata that seeks to decompose them in terms of elementary components. These turn out to correspond to finite aperiodic semigroups and … Wikipedia
Transformation semigroup — In algebra, a transformation semigroup (or composition semigroup) is a collection of functions from a set to itself which is closed under function composition. If it includes the identity function, it is a transformation (or composition) monoid.… … Wikipedia
Sequence — For other uses, see Sequence (disambiguation). In mathematics, a sequence is an ordered list of objects (or events). Like a set, it contains members (also called elements or terms), and the number of terms (possibly infinite) is called the length … Wikipedia
List of abstract algebra topics — Abstract algebra is the subject area of mathematics that studies algebraic structures, such as groups, rings, fields, modules, vector spaces, and algebras. The phrase abstract algebra was coined at the turn of the 20th century to distinguish this … Wikipedia
Commutant — In algebra, the commutant of a subset S of a semigroup (such as an algebra or a group) A is the subset S′ of elements of A commuting with every element of S. In other words, S′ forms a subsemigroup. This generalizes the concept of centralizer in… … Wikipedia
Free monoid — In abstract algebra, the free monoid on a set A is the monoid whose elements are all the finite sequences (or strings) of zero or more elements from A , with the binary operation of concatenation. It is usually denoted A lowast;. The identity… … Wikipedia
Aperiodic monoid — In mathematics, an aperiodic semigroup is a semigroup S such that for every x ∈ S , there exists a nonnegative integer n such that xn = xn + 1 .An aperiodic monoid is an aperiodic semigroup which is a monoid. This notion is in some sense… … Wikipedia
Green's relations — In mathematics, Green s relations are five equivalence relations that characterise the elements of a semigroup in terms of the principal ideals they generate. The relations are named for James Alexander Green, who introduced them in a paper of… … Wikipedia