The Logical Approach to Automatic Sequences(London Mathematical Society Lecture Note Series, 482)

自动序列的逻辑方法:核桃词汇的组合学探索

计算机科学技术基础学科

售   价:
696.00
发货周期:国外库房发货,通常付款后4-6周到货!
作      者
出  版 社
出版时间
2022年09月01日
装      帧
平装
ISBN
9781108745246
复制
页      码
374
开      本
229x152mm
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 30 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
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.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个