Self-Verifying Predicates in B\"uchi Arithmetic
Formal Languages and Automata Theory
2025-07-29 v1 Discrete Mathematics
Combinatorics
Abstract
We discuss a technique, based on Angluin's algorithm, for automatically generating finite automata for various kinds of useful first-order logic formulas in B\"uchi arithmetic. Construction in this way can be faster and use much less space than more direct methods. We discuss the theory and we present some empirical data for the free software Walnut.
Keywords
Cite
@article{arxiv.2507.19717,
title = {Self-Verifying Predicates in B\"uchi Arithmetic},
author = {Mazen Khodier and Luke Schaeffer and Jeffrey Shallit},
journal= {arXiv preprint arXiv:2507.19717},
year = {2025}
}