2000 character limit reached
Pecan: An Automated Theorem Prover for Automatic Sequences using Büchi Automata
Published 2 Feb 2021 in cs.LO | (2102.01727v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.