Equivalence of Context-Free-Grammar and Context-Free-Grammar in CNF
Chomsky normal forms are not unique. If they were, we'd have an algorithm for deciding whether two CF grammars are equal. But equivalence of CF grammars is undecidable.