Pecan: An Automated Theorem Prover for Automatic Sequences using Büchi Automata

02/02/2021
by   Reed Oei, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset