Year: 2025
Type: preprint
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üchi 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.
Source: arXiv (Cornell University)
Authors: Khodier, Mazen, Schaeffer, Luke, Shallit, Jeffrey
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W6979325689
Cites:
Cited by:
Related to: