Automatic Sequences Theory, Applications, Generalizations
Spend $50 to get a
This item qualifies for FREE shipping.
30 day, 100% satisfaction guarantee!
Rush Rewards U
You have reached 400 XP and carrot coins. That is the daily max!
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…
Copyright year: 2003
Publisher: Cambridge University Press
Publication date: 7/21/2003
Size: 7.05" wide x 10.47" long x 1.50" tall
|Number theory and algebra|
|Finite automata and other models of computation|
|Uniform morphisms and automatic sequences|
|Frequency of letters|
|Formal power series|
|Automatic real numbers|
|Multidimensional automatic sequences|
|Hints ï¿½Ç for selected exercises|