Synopses & Reviews
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 Combinatorics on Words. Since its publication, the area has developed and the authors now aim to present several more topics as well as giving deeper insights into subjects that were 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.
Synopsis
Combinatorics on words has arisen independently within several branches of mathematics and appears frequently in problems of theoretical computer science. This subject has developed significantly since the publication of Lothaire's first book, Combinatorics on Words. The author now aims to present several more topics as well as giving deeper insights into subjects that were discussed in the previous volume. With background material, full proofs whenever possible, and a discussion of further developments, this book is both a comprehensive introduction to the subject and a valuable reference source for researchers.
Table of Contents
1. Finite and infinite words J. Berstel and D. Perrin; 2. Sturmian words J. Berstel and P. Séébold; 3. Unavoidable patterns J. Cassaigne; 4. Sesquipowers A. De Luca and S. Varricchio; 5. The plactic monoid A. Lascoux, B. Leclerc and J.-Y. Thibon; 6. Codes V. Bruyère; 7. Numeration systems C. Frougny; 8. Periodicity F. Mignosi and A. Restivo; 9. Centralisers of noncommutative series and polynomials C. Reutenauer; 10. Transformations on words and q-calculus D. Foata and G.-N. Han; 11. Statistics on permutations and words J. Désarménien; 12. Makanin's algorithm V. Diekert; 13. Independent systems of equations T. Harju, J. Karhumäki and W. Plandowski.