代数结构（algebraic structure）.docVIP

代数结构（algebraic structure） The eighth chapter is about several typical algebraic structures In this chapter, we will introduce algebraic structures, semigroups and groups with a two element operation, and algebraic structures, rings and domains with two operations. Semigroups and groups have been applied to form language, fast adder design, error correcting code formulation and automata theory. Section 8.1 semigroup and monoid Semigroup is the simplest algebraic structure, with fewer operations and less computational properties. Semigroups are widely used in sequential machine theory, formal language, syntax analysis and so on. Semigroup, singular point and their subalgebra Define 1 given algebra, where * is two yuan operation, if * satisfy union law, then called algebra is semigroup. Define 2 given algebra, if two element operation * satisfy Union Law and have yuan, be called singular point. It can be seen that the unique monoid is a semigroup containing a finite element. Therefore, some people call the monoid a monoid. Example 1 (1) algebra and all are semigroups, because the operations + and X satisfy the union law; and also the singular point, because 0 is the + $, and 1 is X. (2) algebra and not semigroups, because subtraction and division do not satisfy the law of union. Definition 3 if the semigroup is closed and the operation * is closed, then the subalgebra is called a sub semigroup. It is obvious that a semigroup is a semigroup. Definition 4 if it is singular, and the operations * are closed, then the subalgebra is called the child singular point. Obviously, the unique difference is the unique point. Example 2 (1) algebra and the singular point of the singular and the singular, respectively. (2) if the sigma is non empty finite alphabet, then link sigma + is semigroup, sigma ^ *, link is a monoid. If the link is sigma +, link sub semigroup, link, lambda is sigma ^ *, link sub monoid. Define 5 in a semigroup (singular point), if the operation is co