On the learnability of infinitary regular sets
Oded Maler, Amir Pnueli · Conference on Learning Theory · 1991
In this paper we extend the automaton synthesis paradigm to infinitary languages, that is, to subsets of the set ∑ ω of all infinite sequences over some alphabet ∑. Our main result is a polynomial algorithm for learning a sub-class of the ω -regular sets from membership queries and counter-examples based on the framework suggested in [Ang87].