This paper surveys recent results concerning the inference of deterministic finite automata (DFAs). The results discussed determine the extent to which DFAs can be feasibly inferr...
In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representati...