Prove that Language is not Regular using closure(s)
What is your " ' " operator? Could it perhaps be the homomorphism $0\rightarrow a, 1\rightarrow a, 2\rightarrow b$? If not, consider this as a hint, since regular languages are closed under homomorphisms.