Topics on Combinatorial Semigroups

By combinatorial semigroups, we mean a general term of concepts, facts and methods which are produced in investigating of algebraic and combinatorial properties, constructions, classifications and interrelations of formal languages and automata, codes, finite and infinite words by using semigroup theory and combinatorial analysis. The main research objects in this field are the elements and subsets of the free semigroups and monoids and many combinatorial properties of these objects, which are closely related to algebraic theory of semigroups. This book first introduces some basic concepts and notations in combinatorial semigroups. Since many contents involving the constructions of (generalized) disjunctive languages and regular languages are closely related to the algebraic theory of codes, some selected topics are introduced in the following chapter, including the method of defining codes by using dependence systems, the maximality and completeness of codes, and the detailed discussion of some special kinds of codes such as convex codes, semaphore codes and solid codes. Then the remaining chapters present the main topics of the book - regular languages, disjunctive languages, and their various kinds of generalizations. This book might be useful to researchers in mathematics who are interested in combinatorial semigroups.