Abstract
We study the learnability of symbolic finite state automata (SFA), a model shown useful in many applications in software verification. The state-of-th......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
