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, applications, generalizations
β Scribed by Jean-Paul Allouche, Jeffrey Shallit
- Publisher
- Cambridge University Press
- Year
- 2003
- Tongue
- English
- Leaves
- 587
- Category
- Library
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
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
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 t
<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