11 citations · 49 across the 21 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
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…
cs.LO2019★ 2 cited
Continuous Regular Functions
Alexi Block Gorman, Philipp Hieronymi, Elliot Kaplan +5
Following Chaudhuri, Sankaranarayanan, and Vardi, we say that a function is -regular if there is a Büchi automaton that accepts precisely the set of base $r…