The Leading eBooks Store Online

for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, BlackBerry ...

New to eBooks.com?

Learn more

Automatic Sequences

Theory, Applications, Generalizations

Automatic Sequences
Add to cart
US$ 69.00
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.
Cambridge University Press; July 2003
589 pages; ISBN 9780511055751
Read online, or download in secure PDF format