We study the learnability of symbolic finite state automata (SFA), a model shown useful in many applications software verification. The state-of-the-art literature on this topic follows query learning paradigm, and so far all obtained results are positive. provide necessary condition for efficient SFAs from which we obtain first negative result. main focus our work lies under paradigm identific...
