Free semigroup generated by
From Maths
Stub grade: A
This page is a stub
This page is a stub, so it contains little or minimal information and is on a to-do list for being expanded.The message provided is:
Needs fleshing out, it's like page 6 of the first reference, demote to grade D once satisfactory.
- Note: the free monoid generated by a set is also a semigroup (as all monoids are semgroups), however there is a difference, see Discussion of the free monoid and free semigroup generated by a set
Contents
[hide]Definition
Given a set, X, there is a free semigroup, (F,∗), generated by that set (that is distinct from the free monoid generated by (which of course is also a semigroup) - see discussion of the free monoid and free semigroup generated by a set)[1], defined as follows:
- The elements of F are non-empty tuples of elements of X, (x1,…,xn)∈F for n≥1
- The operation ∗::F×F→F is concatenation of the tuples:
- ∗:((x1,…,xm),(y1,…,yn))↦(x1,…,xm,y1,…,yn)
Terminology
- Be sure to mention word terminology here, this page should be pretty close to free monoid generated by with the obvious differences.