written 7.9 years ago by | modified 2.8 years ago by |
Mumbai University > Computer Engineering > Sem 3 > Discrete Structures
Marks: 8 Marks
Year: May 2016
written 7.9 years ago by | modified 2.8 years ago by |
Mumbai University > Computer Engineering > Sem 3 > Discrete Structures
Marks: 8 Marks
Year: May 2016
written 7.9 years ago by | • modified 7.9 years ago |
Examples
Monoid:
If a semigroup {M, * } has an identity element with respect to the operation * , then {M, * } is called a monoid.
viz., if for any $a,b,c \in M$
$$(a*b)*c=a*(b*c)$$
and if there exists an element $e \in M$ such that for any $a \in M, e*a=a*e=a$, then the algebraic system {M, * } is called a monoid.
For example, if N is the set of natural numbers, then {N,+} and {N,X} are monoids with the identity elements 0 and 1 respectively.
The semigroups {E,+} and {E,X} are not monoids.
Semigroup:
If S is a nonempty set and * be a binary operation on S, then the algebraic system {S, * } is called a semigroup , if the operation * is associative.
viz., if for any $a,b,c \in S$,
$$(a*b)*c=a*(b*c)$$
Since the characteristic property of a binary operation on S is the closure property, it is not necessary to mention it explicity when algebraic systems are defined.
For example, if E is the set of positive even numbers, then {E, + } and {E, X} are semigroups.