Skip to main content Accessibility help
×
  • Cited by 580
    • Show more authors
    • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      13 October 2009
      21 July 2003
      ISBN:
      9780511546563
      9780521823326
      Dimensions:
      (253 x 177 mm)
      Weight & Pages:
      1.157kg, 588 Pages
      Dimensions:
      Weight & Pages:
    You may already have access via personal or institutional login
  • Selected: Digital
    Add to cart View cart Buy from Cambridge.org

    Book description

    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.

    Reviews

    ‘… 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.’

    Source: 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.’

    Source: 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.'

    Source: Computing Reviews

    ‘The book will be of use for beginners as well as for advanced students and researchers.‘

    Source: 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.‘

    Source: 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.'

    Source: Zentralblatt MATH

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    ×

    Contents

    Metrics

    Altmetric attention score

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.