The Logical Approach To Automatic Sequences
Download The Logical Approach To Automatic Sequences PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get The Logical Approach To Automatic Sequences book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
The Logical Approach to Automatic Sequences
Author: Jeffrey Shallit
language: en
Publisher: Cambridge University Press
Release Date: 2022-09-29
Learn how to automatically prove mathematical statements in combinatorics, sequences, and number theory.
The Logical Approach to Automatic Sequences
Author: Jeffrey Shallit
language: en
Publisher: Cambridge University Press
Release Date: 2022-09-29
Automatic sequences are sequences over a finite alphabet generated by a finite-state machine. This book presents a novel viewpoint on automatic sequences, and more generally on combinatorics on words, by introducing a decision method through which many new results in combinatorics and number theory can be automatically proved or disproved with little or no human intervention. This approach to proving theorems is extremely powerful, allowing long and error-prone case-based arguments to be replaced by simple computations. Readers will learn how to phrase their desired results in first-order logic, using free software to automate the computation process. Results that normally require multipage proofs can emerge in milliseconds, allowing users to engage with mathematical questions that would otherwise be difficult to solve. With more than 150 exercises included, this text is an ideal resource for researchers, graduate students, and advanced undergraduates studying combinatorics, sequences, and number theory.
Automatic Sequences
Author: Jean-Paul Allouche
language: en
Publisher: Cambridge University Press
Release Date: 2003-07-21
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.