Free Semigroups and Identites for a Class of Monoids

The study of words as a mathematical object is a deep and rich field of study. Algebra, Combinatorics, Theoretical Computer Science etc., are major disciplines, which are fully using this study. Combinatorial properties (via Codes, Free Hulls, Infinite Words), and algebraic properties of words are presented in this Thesis. The free semigroup on a set (alphabet) X and finite presentation of semigroups have a central place in the algebraic study of words. The last part of the Thesis is devoted to the study of identities in the alphabet X = {x,y} for a class of monoids. The characterization of such identities are given gradually; some elementary identities are established at the beginning. Using the canonical form of a word, mainly triples of positive integers are those that determine all these identities