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
Applied Combinatorics On Words
โ Scribed by M. Lothaire
- Book ID
- 127435873
- Publisher
- Cambridge University Press
- Year
- 2005
- Tongue
- English
- Weight
- 5 MB
- Series
- Encyclopedia of Mathematics and its Applications
- Category
- Library
- ISBN
- 0521848024
No coin nor oath required. For personal study only.
โฆ Synopsis
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 and linguistics.
๐ SIMILAR VOLUMES
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
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
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
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