Skip to content
Register Sign in Wishlist
Automatic Sequences

Automatic Sequences
Theory, Applications, Generalizations

  • Date Published: September 2003
  • availability: Available
  • format: Hardback
  • isbn: 9780521823326


Add to wishlist

Other available formats:

Looking for an inspection copy?

This title is not currently available on inspection

Product filter button
About the Authors
  • Uniting dozens of seemingly disparate results from different fields, this book combines concepts from mathematics and computer science to present the first integrated treatment of sequences generated by 'finite automata'. The authors apply the theory to the study of automatic sequences and their generalizations, such as Sturmian words and k-regular sequences. And further, they provide applications to number theory (particularly to formal power series and transcendence in finite characteristic), physics, computer graphics, and music. Starting from first principles wherever feasible, basic results from combinatorics on words, numeration systems, and models of computation are discussed. Thus this book is suitable for graduate students or advanced undergraduates, as well as for mature researchers wishing to know more about this fascinating subject. Results are presented from first principles wherever feasible, and the book is supplemented by a collection of 460 exercises, 85 open problems, and over 1600 citations to the literature.

    • Unites, using a consistent notation, dozens of open problems for further research
    • Many results appear in English for the first time
    • Contains hundreds of exercises and dozens of open problems for further research
    Read more

    Reviews & endorsements

    '… the very first book that gathers together results from various fields of mathematics and computer science that appeared in a broad variety of journals. It presents the results in a unified manner, making use of a consistent notation and introduces some good unifying terminology, and including most of the material needed for a comprehensive exposition … useful also as a handbook for self study … extremely valuable as a reference text … I strongly recommend this excellent book to anybody interested in interaction between theoretical computer science and mathematics.' ACM SIGACT News

    'The book is very well written, and contains a tremendous amount of information … Advanced students and researchers will delight in reading Automatic Sequences.' Bulletin of the London Mathematical Society

    'The material presented in this book is well balanced, and is presented in a consistent framework … I highly recommend this book to interested readers, from advanced undergraduates to experts in the field of formal languages and number theory.' Computing Reviews

    'The book will be of use for beginners as well as for advanced students and researchers.' EMS Newsletter

    'This book has been written with the greatest care, in a clear and concise style. The authors have included a number of well-chosen examples which illustrate the general theory. Specialists would particularly appreciate the notes at the end of the chapter, recalling the main contributions and the history of the concepts that are discussed. They also provide a useful link with the impressive bibliography.' Semigroup Forum

    'Allouche and Shallit's books presents an introduction to the fascinating subject of automatic sequences. This is the first book that systematically develops the theory of these sequences.' Zentralblatt MATH

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: September 2003
    • format: Hardback
    • isbn: 9780521823326
    • length: 588 pages
    • dimensions: 266 x 179 x 38 mm
    • weight: 1.15kg
    • contains: 170 b/w illus. 548 exercises
    • availability: Available
  • Table of Contents

    1. Stringology
    2. Number theory and algebra
    3. Numeration systems
    4. Finite automata and other models of computation
    5. Automatic sequences
    6. Uniform morphisms and automatic sequences
    7. Morphic sequences
    8. Frequency of letters
    9. Characteristic words
    10. Subwords
    11. Cobham's theorem
    12. Formal power series
    13. Automatic real numbers
    14. Multidimensional automatic sequences
    15. Automaticity
    16. k-regular sequences
    17. Physics
    Appendix. Hints, references and solutions for selected exercises

  • Resources for

    Automatic Sequences

    Jean-Paul Allouche, Jeffrey Shallit

    General Resources

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to lecturers whose faculty status has been verified. To gain access to locked resources, lecturers should sign in to or register for a Cambridge user account.

    Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other lecturers may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.

    Supplementary resources are subject to copyright. Lecturers are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.

    If you are having problems accessing these resources please contact

  • Authors

    Jean-Paul Allouche, Université de Paris XI

    Jeffrey Shallit, University of Waterloo, Ontario

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.