1984/12/28 by M. Lothaire · 6 citations
Computer Science · Mathematics · #Advanced Algebra and Logic #Computability, Logic, AI Algorithms #Geometric and Algebraic Topology #Mathematical Dynamics and Fractals #semigroups and automata theory
paper · doi:10.1017/cbo9780511566097
openalex publication_date 1984/12/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/15
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