.png){kind=icon}
Return
Self-verifying Predicates in Buchi Arithmetic
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-032-02602-6_17.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We discuss a technique, based on Angluin's algorithm, for automatically generating finite automata for various kinds of useful first-order logic formulas in Buchi 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:
finite automata
Buchi arithmetic
Angluin's algorithm
first-order logic
self-verifying predicates
Journal
I
IF:
0
Papers:
22
Citations:
0
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSaveShareSave
View more