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 …