Polynomial inference of universal automata from membership and equivalence queries