Discrete Mathematics/Semigroup

From Wikibooks, open books for an open world
Jump to navigation Jump to search
Discrete Mathematics
 ← Recursion Semigroup

In this section we Define a simple mathematical system, consisting of a set together with a binary operation that has many Important application.

Semi group[edit | edit source]

Let (A,*) be algebraic structure, where * is any binary operation on A. Then, the system (A,*) is semi-group if it satisfies the following properties: 1. The operation * is a closed operation on set A. 2. The operation * is an associative operation.

Discrete Mathematics
 ← Recursion Semigroup