Symbolic automata better balances how are implemented in practice.

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...

We study here the use of di erent representation for in nitary regular languages in extended temporal logi . We fo us on three di erent kinds of a eptan e onditions for nite automata on in nite words, due to B u hi, Streett, and Emerson and Lei (EL), and we study their omputational properties. Our nding is that B u hi, Streett, and EL automata span a spe trum of su in tness. EL automata are e...