✦ LIBER ✦

Combinatorics on words

✍ Scribed by M. Lothaire

Book ID: 127454107
Publisher: Cambridge University Press
Year: 1997
Tongue: English
Weight: 2 MB
Series: Cambridge mathematical library
Edition: 2
Category: Library
City: Cambridge; New York
ISBN-13: 9780521599245

No coin nor oath required. For personal study only.

✦ Synopsis

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. This volume is the first to present a thorough treatment of this theory and includes discussions of Thue's square free words, Van der Waerden's theorem, and Ramsey's theorem. This volume is an accessible text for undergraduate and graduate level students in mathematics and computer science as well as specialists in all branches of applied mathematics.

📜 SIMILAR VOLUMES

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

Combinatorics on words: Christoffel word

Combinatorics on words: Christoffel words and repetitions in words

✍ Jean Berstel, Aaron Lauve, Christophe Reutenauer, and Franco V. Saliola 📂 Library 📅 2008 🏛 American Mathematical Society 🌐 English ⚖ 2 MB

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 pr

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

Algorithmic combinatorics on partial wor

Algorithmic combinatorics on partial words

✍ Francine Blanchet-Sadri 📂 Library 📅 2008 🏛 Chapman & Hall/CRC 🌐 English ⚖ 2 MB

The discrete mathematics and theoretical computer science communities have recently witnessed explosive growth in the area of algorithmic combinatorics on words. The next generation of research on combinatorics of partial words promises to have a substantial impact on molecular biology, nanotechnolo