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

Reed Oei, Dun Ma, Christian Schulz, Philipp Hieronymi

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.

Knowledge Graph



Sign up or login to leave a comment