Pecan: An Automated Theorem Prover for Automatic Sequences using B\"uchi Automata
Logic in Computer Science
2021-02-04 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2102.01727,
title = {Pecan: An Automated Theorem Prover for Automatic Sequences using B\"uchi Automata},
author = {Reed Oei and Dun Ma and Christian Schulz and Philipp Hieronymi},
journal= {arXiv preprint arXiv:2102.01727},
year = {2021}
}
Comments
Working draft