Reversible forms of computations are often interesting from an energy efficiency point of view. When the computation device in question is an automaton, it is known that the minimal reversible automaton recognizing a given language is not necessarily unique, moreover, there are languages having arbitrarily large reversible recognizers possessing no nontrivial “reversible” congruence. Building atop on our earlier result, we show that the corresponding decision problem is [Formula: see text]-complete, and that even in the case when there are only finitely many such reversible recognizers, the largest one among them can be exponentially larger than the minimal automaton. Both results hold for the case of binary alphabets.