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.
Read More
Specifications
Book Details
Title
The Logical Approach to Automatic Sequences
Imprint
Cambridge University Press
Product Form
Paperback
Publisher
Cambridge University Press
Genre
Mathematics
ISBN13
9781108745246
Book Category
Higher Education and Professional Books
BISAC Subject Heading
MAT036000
Book Subcategory
Computing and Information Technology Books
Language
English
Dimensions
Width
20 mm
Height
230 mm
Length
151 mm
Weight
540 gr
Be the first to ask about this product
Safe and Secure Payments.Easy returns.100% Authentic products.