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

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

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2021-02
Hauptverfasser: Oei, Reed, Dun Ma, Schulz, Christian, Hieronymi, Philipp
Format: Artikel
Sprache:eng
Schlagworte:
Automata theory
Automation
Combinatorial analysis
Sequences
Theorem proving
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2331-8422