Mathematics of Discrete Structures for Computer Science

Combinatorics on words has arisen independently within several branches of mathematics, for instance number theory, group theory and probability, and appears frequently in problems related to theoretical computer science. The first unified treatment of the area was given in Lothaire's book Combinatorics on Words. Originally published in 2002, this book presents several more topics and provides deeper insights into subjects discussed in the previous volume. An introductory chapter provides the reader with all the necessary background material. There are numerous examples, full proofs whenever possible and a notes section discussing further developments in the area. This book is both a comprehensive introduction to the subject and a valuable reference source for researchers.

A series of important applications of combinatorics on words has emerged with the development of computerized text and string processing. The aim of this volume, the third in a trilogy, is to present a unified treatment of some of the major fields of applications. After an introduction that sets the scene and gathers together the basic facts, there follow chapters in which applications are considered in detail. The areas covered include core algorithms for text processing, natural language processing, speech processing, bioinformatics, and areas of applied mathematics such as combinatorial enumeration and fractal analysis. No special prerequisites are needed, and no familiarity with the application areas or with the material covered by the previous volumes is required. The breadth of application, combined with the inclusion of problems and algorithms and a complete bibliography will make this book ideal for graduate students and professionals in mathematics, computer science, biology a

Combinatorics on words has arisen independently within several branches of mathematics, for instance number theory, group theory and probability, and appears frequently in problems related to theoretical computer science. The first unified treatment of the area was given in Lothaire's book Combinatorics on Words. Originally published in 2002, this book presents several more topics and provides deeper insights into subjects discussed in the previous volume. An introductory chapter provides the reader with all the necessary background material. There are numerous examples, full proofs whenever possible and a notes section discussing further developments in the area. This book is both a comprehensive introduction to the subject and a valuable reference source for researchers.

Combinatorics on words, or finite sequences, is a field which grew simultaneously within disparate branches of mathematics such as group theory and probability. It has grown into an independent theory finding substantial applications in computer science automata theory and linguistics. This volume is the first to attempt to present a thorough treatment of this theory. All of the main results and techniques are covered. The presentation is accessible to undergraduate and graduate level students in mathematics and computer science as well as to specialists in all branches of applied mathematics. Topics discussed include: Thue's square free words, Van der Waerden's theorem, Ramsey's theorem; factorization of free monoids including application to free Lie algebras; equations in words, etc.