- is a free
monoid.
Transition monoids and
syntactic monoids are used in
describing finite-state machines.
Trace monoids and
history monoids provide a foundation...
- In
abstract algebra, the free
monoid on a set is the
monoid whose elements are all the
finite sequences (or strings) of zero or more
elements from that...
-
computer science, the
syntactic monoid M ( L ) {\displaystyle M(L)} of a
formal language L {\displaystyle L} is the
smallest monoid that
recognizes the language...
- In
abstract algebra, a
monoid ring is a ring
constructed from a ring and a
monoid, just as a
group ring is
constructed from a ring and a group. Let R be...
- the
analogous case of groups) it may be
called an
abelian semigroup. A
monoid is an
algebraic structure intermediate between semigroups and groups, and...
- In
category theory, a
branch of mathematics, a
monoid (or
monoid object, or
internal monoid, or algebra) (M, μ, η) in a
monoidal category (C, ⊗, I) is...
-
complete equivalence under all reorderings. The
trace monoid or free
partially commutative monoid is a
monoid of traces.
Traces were
introduced by
Pierre Cartier...
- the set of
nonnegative integers or the set of integers, but can be any
monoid. The
direct sum
decomposition is
usually referred to as
gradation or grading...
-
topological monoid is a
monoid object in the
category of
topological spaces. In
other words, it is a
monoid with a
topology with
respect to
which the
monoid's binary...
-
category theory, a (strict) n-
monoid is an n-category with only one 0-cell. In particular, a 1-
monoid is a
monoid and a 2-
monoid is a
strict monoidal category...
