Show that the set ALLdfa and ALLnfa is COMPLETE for one of the main complexity classes ( P, NP , PSPACE etc)?
Do we need to show 2 things for proving it is complete?
Meaning for eg: If ALLdfa is in P and all other sets in P are reducible to ALLdfa in poly time, this means ALLdfa is P-Complete? Explaination needed to understand.