Pecan: An Automated Theorem Prover for Automatic Sequences using B\"uchi Automata

Reed Oei,Dun Ma,Christian Schulz,Philipp Hieronymi

arxiv（2021）

引用 1|浏览3

暂无评分

摘要

Pecan is an automated theorem prover for reasoning about properties of Sturmian words, an important object in the field of combinatorics on words. It is capable of efficiently proving non-trivial mathematical theorems about all Sturmian words.

查看译文

关键词

büchi automata,automated theorem prover,automatic sequences

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要