𝔖 Scriptorium
✦   LIBER   ✦
πŸ“

Automatic sequences: theory, applications, generalizations

✍ Scribed by Jean-Paul Allouche, Jeffrey Shallit

Publisher
Cambridge University Press
Year
2003
Tongue
English
Leaves
583
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis

Combining 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.

πŸ“œ SIMILAR VOLUMES

Automatic Sequences: Theory, Application
πŸ“ Automatic Sequences: Theory, Applications, Generalizations
✍ Jean-Paul Allouche, Jeffrey Shallit πŸ“‚ Library πŸ“… 2003 πŸ› Cambridge University Press 🌐 English

Combining 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 basi

Automatic sequences: theory, application
πŸ“ Automatic sequences: theory, applications, generalizations
✍ Allouche J.-P., Shallit J.O. πŸ“‚ Library πŸ“… 2003 πŸ› CUP 🌐 English

Combining 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

Automatic Sequences: Theory, Application
πŸ“ Automatic Sequences: Theory, Applications, Generalizations
✍ Jean-Paul Allouche, Jeffrey Outlaw Shallit πŸ“‚ Library πŸ“… 2003 πŸ› Cambridge University Press 🌐 English

Combining 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

Generalized Locally Toeplitz Sequences:
πŸ“ Generalized Locally Toeplitz Sequences: Theory and Applications: Volume II
✍ Carlo Garoni, Stefano Serra-Capizzano πŸ“‚ Library πŸ“… 2018 πŸ› Springer International Publishing 🌐 English

<p><p>Based on the authors’ research experience, this two-volume reference textbook focuses on the theory of generalized locally Toeplitz sequences and its applications. The first volume discusses the univariate version of the theory and the related applications in the unidimensional setting, while