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.
FREE Two-Day Shipping for students on millions of items. Learn more |
| ||||||||||||||||||
Book Description
Editorial Reviews
Review
"[This volume] presents new aspects of combinatorics on words, recently introduced or developed. This book is totally self contained." Mathematical Reviews
Book Description
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 liguistics. This volume is the first 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.
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
First Sentence:
This chapter contains the main definitions used in the rest of the book. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
arithmetic cadence, critical factorization theorem, first fundamental transformation, circuit monoid, proper left factor, unavoidable regularities, shuffle ideals, parametric words, second fundamental transformation, defect theorem, nondecreasing rearrangement, cyclic roots, free submonoid, cross factor, idempotent monoid, rearrangement class, cyclic solutions, free monoids, shuffle product, overlapping factor, infinite word, nonempty word, topological proof, right factor, combinatorial proof Key Phrases - Capitalized Phrases (CAPs): (learn more)
Proof Let, Rearrangements of Words, Classical Equation New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
This chapter contains the main definitions used in the rest of the book. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
arithmetic cadence, critical factorization theorem, first fundamental transformation, circuit monoid, proper left factor, unavoidable regularities, shuffle ideals, parametric words, second fundamental transformation, defect theorem, nondecreasing rearrangement, cyclic roots, free submonoid, cross factor, idempotent monoid, rearrangement class, cyclic solutions, free monoids, shuffle product, overlapping factor, infinite word, nonempty word, topological proof, right factor, combinatorial proof Key Phrases - Capitalized Phrases (CAPs): (learn more)
Proof Let, Rearrangements of Words, Classical Equation New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 20
books:
See all 20 books this book cites
100
books
cite this book:
See all 100 books citing this book
- Computer Programming (Looking at Series) by Penny Holland in Back Matter
- Combinatorial Identities (Wiley Series in Probability and Mathematical Statistics) by J. Riordan in Back Matter
- The Burnside problem and identities in groups (Ergebnisse der Mathematik und ihrer Grenzgebiete) by S. I Adian in Back Matter
- Proof Theory and Logical Complexity : Volume I (Studies in Proof Theory) by J. y. Girard in Back Matter
- Higher Combinatorics (NATO Science Series C: (closed)) by M. Aigner in Back Matter
See all 20 books this book cites
- Developments in Language Theory: 9th International Conference, DLT 2005, Palermo, Italy, July 4-8, 2005, Proceedings (Lecture Notes in Computer ... Computer Science and General Issues) by Clelia De Felice on 6 pages
- Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications) by M. Lothaire on 4 pages
- Developments in Language Theory: 6th International Conference, DLT 2002, Kyoto, Japan, September 18-21, 2002, Revised Papers (Lecture Notes in Computer Science) by Masami Ito on 4 pages
- Seize problèmes d'informatique: Avec corrigés détaillés et programmes en Caml (SCOPOS) (French Edition) by Bruno Petazzoni on 4 pages
- Formal Languages and Applications (Studies in Fuzziness and Soft Computing) by Carlos Martin-Vide on 4 pages
See all 100 books citing this book
Books on Related Topics
(learn more)
|
Suggested Tags from Similar Products(What's this?)Be the first one to add a relevant tag (keyword that's strongly related to this product).
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
Listmania!
|
|
