Automatic Sequences: Theory, Applications, Generalizations (Hardback)
  • Automatic Sequences: Theory, Applications, Generalizations (Hardback)

Automatic Sequences: Theory, Applications, Generalizations (Hardback)

(author), (author)
Hardback 588 Pages / Published: 21/07/2003
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket
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.

Publisher: Cambridge University Press
ISBN: 9780521823326
Number of pages: 588
Weight: 1150 g
Dimensions: 266 x 179 x 38 mm

'... 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
"[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

You may also be interested in...

Secrets of Creation: Volume 1
Added to basket
Number Theory And Its Applications
Added to basket
A Comprehensive Course in Number Theory
Added to basket
As Easy As Pi
Added to basket
The Man of Numbers
Added to basket
Introduction to Complex Analysis
Added to basket
Fermat's Last Theorem
Added to basket
The Irrationals
Added to basket
Single Digits
Added to basket
Mathematics and Its History
Added to basket
Numbers: A Very Short Introduction
Added to basket
Euclid's Elements
Added to basket
The Higher Arithmetic
Added to basket
Elliptic Tales
Added to basket

Please sign in to write a review

Your review has been submitted successfully.