Search

• < Previous
• 1
• Next >

Inferring Symbolic Automata

We study the learnability of symbolic finite state automata (SFA), a model shown useful in many applications in software verification. The state-of-the-art literature on this topic follows the query learning paradigm, and so far all obtained results are positive. We provide a necessary condition for&nbsp;[&hellip;]