Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Online ordering will be unavailable from Saturday, September 6 at 06:00 GMT until Sunday, September 7 at 14:00 GMT.

To place an order, please contact Customer Services.

UK/ROW directcs@cambridge.org +44 (0) 1223 326050 | US customer_service@cambridge.org 1 800 872 7423 or 1 212 337 5000 | Australia/New Zealand enquiries@cambridge.edu.au 61 3 86711400 or 1800 005 210, New Zealand 0800 023 520

Item added to bagSorry, there was a problem getting your bag informationItem cannot be purchased with the existing contents of your bagItem unavailable online
✕

was added to your bag.

Please try again.

Sorry, this item cannot be purchased in the same transaction as the existing items in your bag.

Please complete the purchase of the items currently in your bag and then add this item in a separate transaction or visit Shopping Help.

Sorry, this product is not currently available to buy online. Please visit Shopping Help.

View bag and checkout
Remove item
✕

Are you sure you want to remove from your bag?

Recommended product

Popular links

Popular links

Algebraic Combinatorics on Words

All titles
Algebraic Combinatorics on Words

Algebraic Combinatorics on Words

Series:
Author:
M. Lothaire
J. Berstel, D. Perrin, P. Séébold, J. Cassaigne, A. De Luca, S. Varricchio, A. Lascoux, B. Leclerc, J.-Y. Thibon, V. Bruyère, C. Frougny, F. Mignosi, A. Restivo, C. Reutenauer, D. Foata, G.-N. Han, J. Désarménien, V. Diekert, T. Harju, J. Karhumäki, W. Plandowski
Published:
July 2013
Availability:
This ISBN is for an eBook version which is distributed on our behalf by a third party.
Format:
Adobe eBook Reader
ISBN:
9781107109476

Looking for an inspection copy?

This title is not currently available for inspection.

    Description

    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 book Combinatorics on Words. Originally published in 2002, this book presents several more topics and provides deeper insights into subjects discussed in the previous volume. An introductory chapter provides the reader with all the necessary background material. There are numerous examples, full proofs whenever possible and a notes section discussing further developments in the area. This book is both a comprehensive introduction to the subject and a valuable reference source for researchers.

    • Companion volume to the classic Combinatorics on Words, covers material not seen in the original and gives deeper insights into some that was
    • Self-contained, with introductory material for those new to the subject
    • Comprehensive, featuring full proof and references for researchers

    Reviews & endorsements

    Review of the hardback: 'This book will certainly become a reference book and have the same impact as the first book of Lotahire: essentially self-contained, with many exercise and interesting notes, not mentioning a bibliography with more than 450 items.' Jean-Paul Allouche, Zentrallblatt MATH

    Review of the hardback: '… an indispensable reference …' Mathematika

    See more reviews

    Product details

    July 2013
    Adobe eBook Reader
    9781107109476
    0 pages
    0kg
    This ISBN is for an eBook version which is distributed on our behalf by a third party.

    Often bought together

    Surveys in Combinatorics 2005
    Surveys in Combinatorics 2005

    : Paperback

    Surveys in Combinatorics
    Surveys in Combinatorics

    : Paperback

    Invited Papers for the Ninth British Combinatorial Conference 1983

    Combinatorics on Words
    Combinatorics on Words

    : Paperback

    Combinatorics and Probability
    Combinatorics and Probability

    : Hardback

    Often bought together

    This title is available for institutional purchase via Cambridge Core

    Learn more
    cambridge core banner

    Related Journals

    Combinatorics, Probability and Computing
    Combinatorics, Probability and Computing

    : Journal

    Published bimonthly, Combinatorics, Probability & Computing is devoted to the three areas of combinatorics, probability theory and theoretical computer science. Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the theory of algorithms (including complexity theory), randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation.

    Theory and Practice of Logic Programming
    Theory and Practice of Logic Programming

    : Journal

    Theory and Practice of Logic Programming emphasises both the theory and practice of logic programming. Logic programming applies to all areas of artificial intelligence and computer science and is fundamental to all of them. Among the topics covered are AI applications that use logic programming, logic programming methodologies, specification, analysis and verification of systems, inductive logic programming, multi-relational data mining, natural language processing, knowledge representation, nonmonotonic reasoning, semantic web reasoning, databases, implementations and architectures and constraint logic programming.

    Journal of Functional Programming
    Journal of Functional Programming

    : Journal

    Journal of Functional Programming is the only journal devoted solely to the design, implementation, and application of functional programming languages, spanning the range from mathematical theory to industrial practice. Topics covered include functional languages and extensions, implementation techniques, reasoning and proof, program transformation and synthesis, type systems, type theory, language-based security, memory management, parallelism and applications. Special tracks are devoted to tools and applications, commercial uses and education; pearl-type papers are encouraged. For more details see the Advice for Authors page..Manuscripts for consideration in the Journal of Functional Programming should be submitted electronically, via Scholar One ManuscriptsTM:  http://mc.manuscriptcentral.com/cup/jfp_submit. See Instructions for Contributors.

    Related Journals

    Also by this Author

    Contents

    Table of Contents

    • 1. Finite and infinite words J. Berstel and D. Perrin
    • 2. Sturmian words J. Berstel and P. Séébold
    • 3. Unavoidable patterns J. Cassaigne
    • 4. Sesquipowers A. De Luca and S. Varricchio
    • 5. The plactic monoid A. Lascoux, B. Leclerc and J.-Y. Thibon
    • 6. Codes V. Bruyère
    • 7. Numeration systems C. Frougny
    • 8. Periodicity F. Mignosi and A. Restivo
    • 9. Centralisers of noncommutative series and polynomials C. Reutenauer
    • 10. Transformations on words and q-calculus D. Foata and G.-N. Han
    • 11. Statistics on permutations and words J. Désarménien
    • 12. Makanin's algorithm V. Diekert
    • 13. Independent systems of equations T. Harju, J. Karhumäki and W. Plandowski.
      • Show more
    Courses
    Resources
    Additional Information
    About the authors
      Contributors

    • J. Berstel, D. Perrin, P. Séébold, J. Cassaigne, A. De Luca, S. Varricchio, A. Lascoux, B. Leclerc, J.-Y. Thibon, V. Bruyère, C. Frougny, F. Mignosi, A. Restivo, C. Reutenauer, D. Foata, G.-N. Han, J. Désarménien, V. Diekert, T. Harju, J. Karhumäki, W. Plandowski

      • Author
    • M. Lothaire
    Accessibility

    Browse by related subject

     
    ✕

    Sorry, this item cannot be purchased in the same transaction as the existing items in your cart.

    Please complete the purchase of the items currently in your cart and then add this item in a separate transaction or contact

    Customer Services