✦ LIBER ✦

Combinatorics on words: Christoffel words and repetitions in words

✍ Scribed by Jean Berstel, Aaron Lauve, Christophe Reutenauer, and Franco V. Saliola

Book ID: 127453995
Publisher: American Mathematical Society
Year: 2008
Tongue: English
Weight: 2 MB
Series: Crm Monograph Series
Edition: draft
Category: Library
ISBN-13: 9780821844809

No coin nor oath required. For personal study only.

✦ Synopsis

The two parts of this text are based on two series of lectures delivered by Jean Berstel and Christophe Reutenauer in March 2007 at the Centre de Recherches Mathematiques, Montreal, Canada. Part I represents the first modern and comprehensive exposition of the theory of Christoffel words. Part II presents numerous combinatorial and algorithmic aspects of repetition-free words stemming from the work of Axel Thue--a pioneer in the theory of combinatorics on words. A beginner to the theory of combinatorics on words will be motivated by the numerous examples, and the large variety of exercises, which make the book unique at this level of exposition. The clean and streamlined exposition and the extensive bibliography will also be appreciated. After reading this book, beginners should be ready to read modern research papers in this rapidly growing field and contribute their own research to its development. Experienced readers will be interested in the finitary approach to Sturmian words that Christoffel words offer, as well as the novel geometric and algebraic approach chosen for their exposition. They will also appreciate the historical presentation of the Thue-Morse word and its applications, and the novel results on Abelian repetition-free words.

📜 SIMILAR VOLUMES

Combinatorics on words

✍ M. Lothaire 📂 Library 📅 1997 🏛 Cambridge University Press 🌐 English ⚖ 2 MB

Combinatorics on words, or finite sequences, is a field that grew from the disparate mathematics branches of group theory and probability. In recent times, it has gained recognition as an independent theory and has found substantial applications in computer science automata theory and linguistics. T

Algebraic Combinatorics on Words

✍ J.-P. Allouche 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 182 KB

Algebraic combinatorics on words

✍ M. Lothaire 📂 Library 📅 2002 🏛 Cambridge University Press 🌐 English ⚖ 5 MB

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

Applied Combinatorics On Words

✍ M. Lothaire 📂 Library 📅 2005 🏛 Cambridge University Press 🌐 English ⚖ 5 MB

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

On primary and secondary repetitions in

On primary and secondary repetitions in words

✍ Roman Kolpakov 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 268 KB

Algorithmic Combinatorics on Partial Wor

Algorithmic Combinatorics on Partial Words

✍ Francine Blanchet-Sadri 📂 Library 📅 2007 🏛 Chapman and Hall/CRC 🌐 English ⚖ 5 MB

The study of combinatorics on words is a relatively new research area in the fields of discrete and algorithmic mathematics. Featuring a simple, accessible style, Algorithmic Combinatorics on Partial Words presents combinatorial and algorithmic concepts in the emerging field of words and partial wor