Automatic Sequences
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Mathematics and Science Textbooks > Mathematics > Number theory > Automatic Sequences: Theory, Applications, Generalizations
Automatic Sequences: Theory, Applications, Generalizations

Automatic Sequences: Theory, Applications, Generalizations


     0     
5
4
3
2
1



Available


X
About the Book

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.

Table of Contents:
Preface; 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; Bibliography; Index.

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


Best Sellers


Product Details
  • ISBN-13: 9780521823326
  • Publisher: Cambridge University Press
  • Publisher Imprint: Cambridge University Press
  • Height: 266 mm
  • No of Pages: 588
  • Returnable: N
  • Spine Width: 38 mm
  • Weight: 1157 gr
  • ISBN-10: 0521823323
  • Publisher Date: 21 Jul 2003
  • Binding: Hardback
  • Language: English
  • Returnable: N
  • Returnable: N
  • Sub Title: Theory, Applications, Generalizations
  • Width: 179 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Automatic Sequences: Theory, Applications, Generalizations
Cambridge University Press -
Automatic Sequences: Theory, Applications, Generalizations
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Automatic Sequences: Theory, Applications, Generalizations

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!