Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages
Deterministic omega automata that are isomorphic to their right congruence automata, the fully informative classes, can be efficiently learned from polynomial-size characteristic samples.
