Question regarding languages and P According to this Wikipedia article on unary language every unary language has a binary variant. My question is that given a unary language is there an equivalent binary language in P that is P-Complete.
As said Yuval Filmus in the comment, some unary languages are undecidable, so they don't even have an equivalent binary language in P.