Automatic Sequences
Automatic Sequences
Looking for an examination copy?
This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact [email protected] providing details of the course you are teaching.
$124.00
USDCombining concepts of mathematics and computer science, this book is about the sequences of symbols that can be generated by simple models of computation called "finite automata". Suitable for graduate students or advanced undergraduates, it starts from elementary principles and develops the basic theory. The study then progresses to show how these ideas can be applied to solve problems in number theory and physics.
- 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
Reviews & endorsements
"[A] fine book...I highly recommend Automatic Sequences, whether as text, reference, or all the more as an excellent read, both to rank beginners and to those already acquainted with parts of the subject."
Alf van der Poorten, Centre for Number Theory Research, Mathematics of Computation
"Every serious sequence lover will want to own a copy!"
Neil Sloane, AT&T Research
"...this book will soon become the Bible on the subject..."
Jia-Yan Yao, Wuhan University
"The book is a successful combination of a monograph (almost encyclopedic) and an introduction to the subject. Professional mathematicians and theoretical computer scientists will find the most important results, applications and examples of the theory, with motivation, cleverly collected and clearly represented. Selected applications in number theory, combinatorics on words and physics show the strength of the theory. Lists of open questions show the way for further development. All this is supplemented with a bibliographical notes and comments, and an impressive list of references...This is a good and carefully written book by two experts in the field."
Guentcho Skordev, University of Bremen
"It is extremely valuable as a reference text for researchers... I strongly recommend this book to anybody interested in interaction between theoretical computer science and mathematics."
Jean Berstel, SIGACT News
Product details
December 2004Adobe eBook Reader
9780511055751
0 pages
0kg
170 b/w illus. 548 exercises
This ISBN is for an eBook version which is distributed on our behalf by a third party.
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.
