11 citations · 17 across the 2 of their papers we have counts for
2 papers
cs.LO2021★ 6 cited
Pecan: An Automated Theorem Prover for Automatic Sequences using Büchi Automata
Reed Oei, Dun Ma, Christian Schulz +1
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 prov…
cs.LO2021★ 11 cited
Decidability for Sturmian words
Philipp Hieronymi, Dun Ma, Reed Oei +3
We show that the first-order theory of Sturmian words over Presburger arithmetic is decidable. Using a general adder recognizing addition in Ostrowski numeration systems by Baranwa…